Performance guarantees for flowshop heuristics to minimize makespan

European Journal of Operational Research

Volumn 169, Issue 3, 2006, Pages 865-872

  Gupta, Jatinder N D ^a   Koulamas, Christos ^b   Kyparisis, George J ^b  

^a UNIVERSITY OF ALABAMA IN HUNTSVILLE   (United States)

^b FLORIDA INTERNATIONAL UNIVERSITY   (United States)

Author keywords

Analysis of algorithms; Flowshop heuristics; Multiple machines; Production scheduling

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; PROBABILITY; PROBLEM SOLVING; SCHEDULING;

ANALYSIS OF ALGORITHMS; FLOWSHOP HEURISTICS; MULTIPLE MACHINES; PRODUCTION SCHEDULING;

MACHINE SHOPS;

EID: 27144465233     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.05.034     Document Type: Article

References (46)

1. I. Averbakh, and O. Berman A simple heuristic for m-machine flow-shop and its applications in routing-scheduling problems Operations Research 47 1999 165 170
2. I. Barany A vector-sum theorem and its application to improving flow shop guarantees Mathematics of Operations Research 6 1981 445 452
3. H.G. Campbell, R.A. Dudek, and M.L. Smith A heuristic algorithm for the n job m machine sequencing problem Management Science 16 1970 B630 B637
4. B. Chen, C.A. Glass, C.N. Potts, and V.A. Strusevich A new heuristic for three-machine flow shop scheduling Operations Research 44 1996 891 898
5. E.G. Coffman Jr., and E.N. Gilbert On the expected relative performance of list scheduling Operations Research 33 1985 548 561
6. D.G. Dannenbring An evaluation of flow-shop sequencing heuristics Management Science 23 1977 1174 1182
7. B.I. Dushin Note on the algorithm for Johnson's single route problem Cybernetics 16 1980 300 303
8. J.M. Framinan, J.N.D. Gupta, and R. Leisten A review and classification of heuristics for permutation flowshop scheduling with makespan objective Journal of Operational Research Society 55 2004 1243 1255 Also, see their Corrigendum. Journal of Operational Research Society 56, 351
9. M.R. Garey, D.S. Johnson, and R. Sethi The complexity of flowshop and jobshop scheduling Mathematics of Operations Research 1 1976 117 129
10. T. Gonzalez, and S. Sahni Flowshop and jobshop schedules: Complexity and approximation Operations Research 26 1978 36 52
11. Gupta, J.N.D., 1971a. Flowshop scheduling via sorting analogy. UARI Report No. 109, University of Alabama in Huntsville, Huntsville, AL, USA.
12. J.N.D. Gupta A functional heuristic algorithm for the flow-shop scheduling problem Operational Research Quarterly 22 1971 39 47
13. J.N.D. Gupta Heuristic algorithms for multistage flowshop scheduling problem AIIE Transactions 4 1972 11 18
14. Gupta, J.N.D., 1974. Flowshop scheduling via sorting analogy: multi-sorting algorithms, ORSA/TIMS Joint Meeting, San Juan, Puerto Rico, 16-18 October 1974.
15. J.N.D. Gupta Optimal schedules for special structure flowshops Naval Research Logistics Quarterly 26 1975 255 269
16. J.N.D. Gupta A heuristic algorithm for the flowshop scheduling problem Revue Francaise d'Automatique, Informatique, Recherche Operationnelle 10 1976 63 73
17. J.N.D. Gupta A review of flowshop scheduling research L.P. Ritzman Disaggregation Problems in Manufacturing and Service Organizations 1979 Martinus Nijhoff The Hague, Netherlands 359 364
18. Gupta, J.N.D., Smutnicki, C., in preparation. Flowshop scheduling via sorting analogy: Selected worst-case analysis, Working Research Paper.
19. L.A. Hall Approximability of flow-shop scheduling Mathematical Programming 82 1998 175 190
20. T.S. Hundal, and J. Rajgopal An extension of palmer's heuristic for the flow-shop scheduling problem International Journal of Production Research 26 1988 1119 1124
21. S.M. Johnson Optimal two- and three-stage production schedules with setup times included Naval Research Logistics Quarterly 1 1954 61 68
22. J.R. King, and A.S. Spachis Heuristics for flow-shop scheduling International Journal of Production Research 18 1980 345 357
23. C. Koulamas, and G.J. Kyparisis Asymptotically optimal linear time algorithms for two-stage and three-stage flexible flow shops Naval Research Logistics 47 2000 259 268
24. T.-C. Lai A note on heuristics of flow-shop scheduling Operations Research 44 1996 648 652
25. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys Sequencing and scheduling: Algorithms and complexity S.C. Graves A.H.G. Rinnooy Kan P.H. Zipkin Handbooks in Operations Research and Management Science Logistics of Production and Inventory Vol. 4 1993 North-Holland Amsterdam 445 522
26. H.R. Lourenco Sevast'yanov's algorithm for the flow-shop scheduling problem European Journal of Operational Research 91 1996 176 189
27. I. Nabeshima On bounds of makespan and its application in M-machine scheduling problems Journal of Operational Research Society of Japan 9 1963 98 136
28. M. Nawaz, E.E. Enscore Jr., and I. Ham A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem OMEGA 11 1983 91 95
29. E. Nowicki Tabu search method in job scheduling problems 1999 1 250 (in Polish)
30. E. Nowicki, and C. Smutnicki Worst-case analysis of an approximation algorithm for flow-shop scheduling Operations Research Letters 8 1989 171 177
31. E. Nowicki, and C. Smutnicki Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling Operations Research Letters 10 1991 473 480
32. E. Nowicki, and C. Smutnicki New results in the worst-case analysis for flow-shop scheduling Discrete Applied Mathematics 46 1993 21 41
33. E. Nowicki, and C. Smutnicki A note on worst-case analysis of approximation algorithms for a scheduling problem European Journal of Operational Research 74 1994 128 134
34. E.S. Page An approach to scheduling jobs on machines Journal of the Royal Statistical Society 23 1961 484 492
35. D.S. Palmer Sequencing jobs through a multi-stage process in the minimum total time-a quick method of obtaining a near optimum Operational Research Quarterly 16 1965 101 107
36. C. Potts, D.B. Shmoys, and D.P. Williamson Permutation vs. non-permutation flow-shop schedules Operations Research Letters 10 1991 281 284
37. H. Röck, and G. Schmidt Machine aggregation heuristics in shop scheduling Methods of Operations Research 45 1983 303 314
38. S.V. Sevast'janov Approximation algorithms for Johnson's and vector summation problems Upravlyaemye Systemy 20 1980 64 73 (in Russian)
39. S.V. Sevast'janov Some generalizations of the Johnson problem Upravlyaemye Systemy 21 1981 45 61 (in Russian)
40. S.V. Sevast'janov Algorithms with estimates for the Johnson and Akers-Friedman problems in the case of three machines Upravlyaemye Systemy 22 1982 51 57 (in Russian)
41. S.V. Sevast'janov On some geometric methods in scheduling theory: A survey Discrete Applied Mathematics 55 1994 59 82
42. S. Sevast'janov Vector summation in Banach space and polynomial algorithms for flow shops and open shops Mathematics of Operations Research 20 1995 90 103
43. S. Sevast'janov Nonstrict vector summation in the plane and its application to scheduling problems A.D. Korshunov Operations Research and Discrete Analysis 1997 Kluwer Dordrecht 241 272
44. D.B. Shmoys, C. Stein, and J. Wein Improved approximation algorithms for shop scheduling problems SIAM Journal on Computing 23 1994 617 632
45. C. Smutnicki Some results of the worst-case analysis for flow shop scheduling European Journal of Operational Research 109 1998 66 87
46. D.P. Williamson, L.A. Hall, J.A. Hoogeveen, C.A.J. Hurkens, J.K. Lenstra, S.V. Sevast'janov, and D.B. Shmoys Short stop schedules Operations Research 45 1997 288 294