Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem

International Journal of Production Research

Volumn 41, Issue 1, 2003, Pages 121-148

  Framinan, J M ^a   Leisten, R ^b   Rajendran, C ^c  

^a UNIVERSIDAD DE SEVILLA   (Spain)

^b UNIVERSITY OF DUISBURG ESSEN   (Germany)

^c INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; HEURISTIC METHODS; ITERATIVE METHODS; POLYNOMIALS;

OBJECTIVE FUNCTIONS;

OPERATIONS RESEARCH;

EID: 0037578177     PISSN: 00207543     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207540210161650     Document Type: Article

References (24)

1. ALLAHVERDI, A. and ALDOWAISAN, T., 2002, New heuristics to minimize total completion time in m-machine flowshops. International Journal of Production Economics, 77, 71-83.
2. BAMBERG, G. and BAUR, F., 1998, Statistik, 10th edn (Munich: Oldenbourg).
3. CAMPBELL, H. G., DUDEK, R. A. and SMITH, M. L., 1970, A heuristic algorithm for the n-job, m-machine sequencing problem. Management Science, 16, B630-B637.
4. DANNENBRING, D. G., 1977, An evaluation of flow-shop sequence heuristics. Management Science, 23, 1174-1182.
5. FRENCH, S., 1982, Sequencing and Scheduling: An Introduction to the Methodologies of the Jobshop (New York: Ellis Horwood).
6. GAREY, M. R., JOHNSON, D. S. and SETHI, R., 1976, The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1, 117-129.
7. GUPTA, J. N. D., 1972, Heuristic algorithms for multistage flowshop scheduling problem. AIIE Transactions, 4, 11-18.
8. HO, J. C., 1995, Flowshop sequencing with mean flowtime objective. European Journal of Operational Research, 81, 571-578.
9. HO, J. C. and CHANG, Y. L., 1991, A new heuristic for the n-job, m-machine flow-shop problem. European Journal of Operational Research, 52, 194-202.
10. HUNDAL, T. S. and RAJGOPAL, J., 1988, An extension of Palmer heuristic for the flow shop scheduling problem. International Journal of Production Research, 26, 1119-1124.
11. KENKEL, J. L., 1996, Introductory Statistics for Management and Economics, 4th edn (Belmont: Duxbury).
12. KING, A. R. and SPACHIS, A. S., 1980, Heuristics for flow-shop scheduling. International Journal of Production Research, 18, 345-357.
13. MIYAZAKI, S., NISHIYAMA, N. and HASHIMOTO, F., 1978, An adjacent pairwise approach to the mean flowtime scheduling problem. Journal of the Operations Research Society of Japan, 21, 287-299.
14. NAWAZ, M., ENSCORE, E. E. and HAM, I., 1983, A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA, 11, 91-95.
15. PALMER, D. S., 1965, Sequencing jobs through a multistage process in the minimum total time: a quick method of obtaining a near-optimum. Operational Research Quarterly, 16, 101-107.
16. RAJENDRAN, C., 1993, Heuristic algorithm for scheduling in a flowshop to minimise total flowtime. International Journal of Production Economics, 29, 65-73.
17. RAJENDRAN, C. and CHAUDHURI, D., 1991, An efficient heuristic approach to the scheduling of jobs in a flowshop. European Journal of Operational Research, 61, 318-325.
18. RAJENDRAN, C. and ZIEGLER, H., 1995, An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs. European Journal of Operational Research, 103, 129-138.
19. RINNOOY KAN, A. H. G., 1976, Machine Scheduling Problems: Classification, Complexity, and Computations (The Hague: Martinus Nijhoff).
20. SRIDHAR, J. and RAJENDRAN, C., 1996, Scheduling in flowshop an cellular manufacturing systems with multiple objectives - a genetic algorithmic approach. Production Planning and Control, 7, 374-382.
21. STINSON, J. P. and SMITH, A. W., 1982, A heuristic programming procedure for sequencing the static flowshop. International Journal of Production Research, 20, 753-764.
22. TAILLARD, E., 1990, Some efficient methods for the flow shop sequencing problem. European Journal of Operational Research, 47, 65-74.
23. TURNER, S. and BOOTH, D., 1987, Comparison of heuristics for flowshop sequencing. OMEGA, 15, 75-85.
24. WOO, D. S. and YIM, H. S., 1998, A heuristic algorithm for mean flowtime objective in flowshop scheduling. Computers and Operations Research, 25, 175-182.