Some results of the worst-case analysis for flow shop scheduling

European Journal of Operational Research

Volumn 109, Issue 1, 1998, Pages 66-87

  Smutnicki, Czesław ^a  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Flow shop; Heuristics; Scheduling; Worst case analysis

Indexed keywords

EID: 0002906088     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00139-2     Document Type: Article

References (41)

1. H.G. Campbell, R.A. Dudek, M.L. Smith, A heuristic algorithm for the n job m machine sequencing problem, Management Science B 16 (1970) 630-637.
2. C.L. Chen, V.S. Vempati, N. Aljaber, An application of genetic algorithm for fiowshop problems, European Journal of Operational Research 80 (1995) 389-396.
3. D.G. Dannenbring, An evaluation of flow-shop sequencing heuristics, Management Science 23 (1977) 1174-1182.
4. B.A. Diaz, Restricted neighborhood in the tabu search for the flowshop problem, European Journal of Operational Research 62 (1992) 27-37.
5. L.F. Gelders, N. Sambandam, Four simple heuristics for a flow-shop, International Journal of Production Research 16 (1978) 221-231.
6. T. Gonzales, S. Sahni, Flow shop and job shop schedules: complexity and approximation, Operations Research 26 (1978) 36-52.
7. J. Grabowski, E. Skubalska, C. Smutnicki, On flow shop scheduling with release and due dates to minimize maximum lateness, Journal of the Operational Research Society 34, (1983) 615-620.
8. J.N.D. Gupta, A functional heuristic algorithm for the flow-shop scheduling problem, Operational Research Quarterly 22 (1971) 39-17.
9. J.C. Ho, Y.L. Chang, A new heuristic for the n-job, m-machine flow-shop problem, European Journal of Operational Research 52 (1990) 194-206.
10. J.C. Ho, Flowshop sequencing with mean flowtime objective, European Journal of Operational Research 81 (1995) 571-578.
11. J.A. Hoogeveen, T. Kawaguchi, Minimizing total completion time in a two-machine flowshop: analysis of special cases, Working Paper, Eindhoven University of Technology, 1995.
12. T.S. Hundal, J. Rajgopal, An extension of Palmers's heuristic for the flow-shop scheduling problem, International Journal of Production Research 26 (1988) 1119-1124.
13. H. Ishibuchi, S. Misaki, H. Tanaka, Modified simulated annealing algorithms for the flowshop sequencing problems, European Journal of Operational Research 81 (1995) 388-398.
14. J.R. King, A.S. Spachis, Heuristics for flowshop scheduling, International Journal of Production Research 19 (1980) 345-357.
15. M.J. Krone, K. Steiglitz, Heuristic-programming solution of a flow-shop scheduling problem, Operations Research 22 (1974) 629-638.
16. T.C. Lai, A note on heuristics of flow-shop scheduling, Operations Research 44 (1996) 648-652.
17. S. Miyazaki, N. Nishiyama, F. Hashimoto, An adjacent pairwise approach to the mean flow-time scheduling problem, Journal of the Operations Research Society of Japan 21 (1978) 287-299.
18. S. Miyazaki, N. Nishiyama, Analysis for minimizing weighted mean flow-time in flow-shop scheduling, Journal of the Operations Research Society of Japan 23 (1980) 118-132.
19. M. Nawaz, E.E. Enscore, Jr., I. Ham, A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem, OMEGA 11 (1983) 91-95.
20. E. Nowicki, C. Smutnicki, Worst-case analysis of an approximation algorithm for flow-shop scheduling, Operations Research Letters 8 (1989) 171-177.
21. E. Nowicki, C. Smutnicki, Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling. Operations Research Letters 10 (1991) 473-480.
22. E. Nowicki, C. Smutnicki, New results in the worst-case analysis for flow-shop scheduling, Discrete Applied Mathematics 46 (1993) 21-41.
23. E. Nowicki, C. Smutnicki, A note on worst-case analysis of an aproximation algorithm for flow-shop scheduling, European Journal of Operational Research 74 (1994) 128-134.
24. E. Nowicki, C. Smutnicki, A fast tabu search algorithm for the flow shop problem, European Journal of Operational Research 91 (1996) 160-175.
25. max flowshop problem, Computers & Operations Research 17 (1990) 243-253.
26. I.H. Osman, C.N. Potts, Simulated Annealing for permutation flow shop scheduling, OMEGA 17 (1989) 551-557.
27. E.S. Page, An approach to scheduling jobs on machines, Journal of the Royal Statistics Society. Series B 23 (1961) 484-492.
28. D.S Palmer, Sequencing jobs through a multi-stage process in the minimum total time - a quick method of obtaining near optimum, Operations Research Quarterly 16 (1965) 101-107.
29. C. Rajendran, D. Chaudhuri, An efficient heuristic approach to the scheduling of jobs in a flow-shop, European Journal of Operational Research 61 (1992) 318-325.
30. C. Rajendran, D. Chaudhuri, A flowshop scheduling algorithm to minimize total flowtime, Journal of the Operations Research Society of Japan 34 (1991) 28-46.
31. C. Rajendran, Heuristic algorithm for scheduling in a flowshop to minimize total flowtime, International Journal of Production Economics 29 (1993) 65-73.
32. C. Rajendran, A heuristic for scheduling in flowshop and flowline-based manufacturing cells with multiple-criteria, International Journal of Production Research 32 (1994) 2541-2558.
33. C. Rajendran, Heuristics for scheduling in flowshop with multiple objectives, European Journal of Operational Research 82 (1995) 540-555.
34. C.R. Reeves, A genetic algorithm for flowshop sequencing, Computers & Operations Research 22 (1995) 5-13.
35. H. Rock, G. Schmidt, Machine aggregation heuristics in shop scheduling, Methods of Operations Research 45 (1982) 303-314.
36. C. Smutnicki, Results of the worst-case analysis for some scheduling problems, in: Proceedings of 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation, 1995, pp. 105-115.
37. E. Taillard, Some efficient heuristic methods for flow shop sequencing, European Journal of Operational Research 47 (1990) 65-74.
38. E. Taillard, Benchmarks for basic scheduling problems, European Journal of Operational Research 64 (1993) 278-285.
39. S. Turner, D. Booth, Comparison of heuristics for flow shop sequencing, OMEGA 15 (1987) 75-78.
40. F. Werner, On the heuristic solution of the Permutation Flow Shop Problem, Computers & Operations Research 20 (1993) 707-722.
41. M. Widmer, A. Hertz, A new heuristic method for the flow shop sequencing problem, European Journal of Operational Research 41 (1989) 186-193.