Scheduling flowshops with finite buffers and sequence-dependent setup times

Computers and Industrial Engineering

Volumn 36, Issue 1, 1999, Pages 163-177

  Norman, Bryan A ^a  

^a UNIVERSITY OF PITTSBURGH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; INVENTORY CONTROL; PROCESS CONTROL; RESOURCE ALLOCATION; SCHEDULING; STRATEGIC PLANNING;

FLOWSHOPS; SEQUENCE-DEPENDENT SETUP TIMES;

PRODUCTION CONTROL;

EID: 0032683531     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0360-8352(99)00007-8     Document Type: Article

References (36)

1. Allahverdi A, Gupta JND, Aldowaisan T. A review of scheduling research involving setup considerations. Omega, in press.
2. Baker K. Elements of sequencing and scheduling. 1995;Amos Tuck School of Business Administration, Dartmouth College, Hanover, NH.
3. Birewar D.B., Grossmann I.E. Incorporating scheduling in the optimal design of multiproduct batch plants. Computers and Chemical Engineering. 13:1989;141-161.
4. Birewar D.B., Grossmann I.E. Efficient optimization algorithms for zero-wait scheduling of multiproduct batch plants. Industrial and Engineering Chemistry Research. 28:1989;1333-1345.
5. Campbell H.G., Dudek R.A., Smith M.L. A heuristic algorithm for the n job m machine sequencing problem. Management Science. 16:1970;B630-637.
6. Garey M.R., Johnson D.S., Sethi R. The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research. 1:1976;117-129.
7. Glover F., Laguna M. Tabu Search. 1997;Kluwer Academic Publishers.
8. Gupta J.N.D. Flowshop schedules with sequence-dependent setup times. Journal of the Operations Research Society of Japan. 29:1986;206-219.
9. Johnson S.M. Optimal two and three-stage production schedules with setup times included. Naval Research Logistics Quarterly. 1:1954;61-68.
10. Karabati S., Kouvelis P. Cyclic scheduling in flow lines: modeling observations, effective heuristics and a cycle time minimization procedure. Naval Research Logistics. 43:1996;211-231.
11. King J.R., Spachis A.S. Heuristics for flowshop scheduling. International Journal of Production Research. 18:1980;343-357.
12. Kondili E., Pantelides C.C., Sargent R.W.H. A general algorithm for short-term scheduling of batch operations. I. MILP formulation. Computers and Chemical Engineering. 17:1993;211-227.
13. Kondili E., Pantelides C.C., Sargent R.W.H. A general algorithm for short-term scheduling of batch operations. II. Computational issues. Computers and Chemical Engineering. 17:1993;229-244.
14. Kudva G., Elkamel A., Pekny J.F., Reklaitis G.V. Heuristic algorithm for scheduling batch and semicontinuous plants with production deadlines, intermediate storage limitations and equipment changeover costs. Computers and Chemical Engineering. 18:1994;859-875.
15. Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G. Recent developments in deterministic sequencing and scheduling: a survey. Dempster M.A.H., Lenstra J.K., Rinnooy Kan A.H.G. Deterministic and stochastic scheduling: Proceedings of the NATO Advanced Study and Research Institute on Theoretical Approaches to Scheduling Problems. 1982;Reidel, Dordrecht.
16. Leisten R. Flowshop sequencing problems with limited buffer storage. International Journal of Production Research. 28:1990;2085-2100.
17. McCormick S.T., Pinedo M.L., Shenker S., Wolf B. Sequencing in an assembly line with blocking to minimize cycle time. Operations Research. 37:1989;925-936.
18. Michalewicz Z. Genetic algorithms+data structures=evolution programs. 2nd ed :1994;Springer-Verlag.
19. Kim M., Jung J.H., Lee I. Optimal scheduling of multiproduct batch processes for various intermediate storage policies. Industrial and Engineering Chemistry Research. 35:1996;4058-4066.
20. Nawaz M., Enscore E.E., Ham I. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega. 11:1983;91-95.
21. Norman BA Random keys genetic algorithm for complex scheduling problems. Ph.D. thesis, Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, 1995.
22. Nowicki E, Smutnicki C. A fast tabu search algorithm for the flow shop problem. Report 8/94. Institute of Engineering Cybernetics, Technical University of Wroclaw, 1993.
23. max flowshop problem. Computers and Operations Research. 17:1990;243-253.
24. Ogbu F.A., Smith D.K. Simulated annealing for the permutation flow-shop problem. Omega. 19:1991;64-67.
25. Osman I.H., Potts C.N. Simulated annealing for permutation flow-shop scheduling. Omega. 17:1989;551-557.
26. Papadimitriou C.H., Kanellakis P.C. Flowshop scheduling with limited temporary storage. Journal of the Association for Computing Machinery. 27:1980;533-554.
27. Pinedo M. Scheduling theory, algorithms, and systems. 1995;Prentice-Hall.
28. Pinto J.M., Grossmann I.E. Optimal cyclic scheduling of multistage continuous multiproduct plants. Computers and Chemical Engineering. 18:1994;797-816.
29. Rajendran C. A no-wait flowshop scheduling heuristic to minimize makespan. Journal of the Operational Research Society. 45:1994;472-478.
30. Reeves C. Improving the efficiency of tabu search for machine sequencing problems. Journal of the Operational Research Society. 44:1993;375-382.
31. Reeves C. Modern heuristic techniques for combinatorial problems. 1993;Blackwell Scientific Publishing.
32. Reeves C. A genetic algorithm for flowshop scheduling. Computers and Operations Research. 22:1995;5-13.
33. Taillard E. Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research. 47:1990;65-74.
34. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research. 64:1993;278-285.
35. Widmer M., Hertz A. A new heuristic method for the flow shop sequencing problem. European Journal of Operational Research. 41:1989;186-193.
36. Wismer D.A. Solution of flowshop scheduling problem with no intermediate queues. Operations Research. 20:1972;689-697.