Lot streaming and scheduling heuristics for m-machine no-wait flowshops

Computers and Industrial Engineering

Volumn 38, Issue 1, 2000, Pages 149-172

  Kumar, Subodha ^a   Bagchi, Tapan P ^b   Sriskandarajah, C ^a  

^a UNIVERSITY OF TEXAS AT DALLAS   (United States)

^b INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS; HEURISTIC METHODS; SCHEDULING; TRAVELING SALESMAN PROBLEM;

LOT STREAMING; NO-WAIT FLOWSHOPS;

COMPUTER INTEGRATED MANUFACTURING;

EID: 0033708147     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0360-8352(00)00035-8     Document Type: Article

References (34)

1. Bagchi T.P., Deb K. Calibration of GA parameters: the design of experiments approach. Computer Science and Informatics. 26:(3):1996.
2. Baker K.R. Solution procedures for the lot-streaming problem. Decision Sciences. 21:1990;475-491.
3. Baker, K.R. (1993). Lot streaming in the two machine flow shop with setup times. Working Paper No. 297. The Amos Truck School, Dartmouth College, Hanover, NH.
4. Baker K.R., Jia D. A comparative study of lot streaming procedure. OMEGA. 21:1993;561-566.
5. Baker K.R. Elements of sequencing and scheduling. 1995;Amos Tuck School of Business Administration, Dartmouth College, Hanover, NH.
6. Chen A., Vempati V.S., Aljaber N. An application of genetic algorithms for flowshop problems. European Journal of Operational Research. 80:1995;389-396.
7. Connoly D. General purpose simulated annealing. Journal of Operational Research Society. 43:(3):1992;495-505.
8. Davis L. Handbook of genetic algorithms. 1991;Van Nostrand Reinhold, New York.
9. Erben W. Time tabling using artificial neural nets and genetic algorithms. Proceedings of the International Conference in Ales, France :1995;30-32.
10. Garey M.R., Johnson D.S. Computers and intractability: a guide to the theory of NP-completeness. 1979;Freeman, San Francisco.
11. Gendreu M., Hertz A., Laporte G. New insertion and postoptimization procedures for the traveling salesman problem. Operations Research. 12:1992;665-679.
12. Glass C.A., Gupta J.N.D., Potts C.N. Lot streaming in three-stage process. European Journal of Operational Research. 75:1994;378-394.
13. Glover F., Laguna M. Tabu search. 1997;Kluwer Academic Publishers, Dordrecht.
14. Goldberg D.E. Genetic algorithm in search, optimization and machine learning. 1989;Addison-Wesley, Reading, MA.
15. Goyal S.K., Sriskandarajah C. No-wait shop scheduling: computational complexity and approximate algorithms. Opsearch. 25:1988;220-244.
16. Hall N.G., Sriskandarajah C. A survey of machine scheduling problems with blocking and no-wait in process. Operations Research. 44:1996;510-525.
17. Holland J.H. Adaption in natural and artificial system. 1975;University of Michingan Press, Ann Arbor.
18. Kumar, S. (1997). An application of genetic algorithms in no-wait lot streaming flowshop scheduling. M.Tech. thesis, Indian Institute of Technology, Kanpur.
19. Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., Shmoys D.B. The traveling salesman problem: a guided tour of combinatorial optimization. 1985;Wiley, Chichester, UK.
20. Michaelewicz Z. Genetic algorithms + data structures = evolution programs. 1992;Springer-Verlag, Berlin.
21. Montgomery Douglas C. Design and analysis of experiments. 3rd ed. 1991;Wiley, New York.
22. Murata T., Ishibuchi H. Performance evaluation of genetic algorithms for flowshop scheduling problems. Proceedings of the IEEE Conference on Genetic Algorithms :1994;812-817.
23. Pinedo M. Scheduling: theory, algorithms and systems. 1995;Prentice-Hall, Englewood Cliffs, NJ.
24. Portmann M.C. Scheduling methodology: optimization and compu-search approaches I. Artiba A., Elmaghraby S.E. Production and scheduling of manufacturing system. 1996;Chapman & Hall, London.
25. Potts C.N., Baker K.R. Flow shop scheduling with lot streaming. Operations Research Letters. 8:1989;297-303.
26. Potts C.N., van Wassenhove L.N. Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity. Journal of Operational Research Society. 43:(5):1992;395-406.
27. Sriskandarajah C., Wagneur E. Lot streaming and scheduling multiple products in a two-machine no-wait flowshops. IIE Transactions. 31:1999;695-707.
28. Steiner G., Truscott W.G. Batch scheduling to minimize cycle time, flow time and processing cost. IIE Transactions. 25:(5):1993;90-97.
29. STORM® Software, (1992). Storm Software, Cleveland, OH.
30. Szendrovits A.Z. Manufacturing cycle time determination for a multi-stage economic production quantity model. Management Science. 22:1975;298-308.
31. Trietsch D., Baker K.R. Basic techniques for lot streaming. Operations Research. 41:(6):1993;1065-1076.
32. Truscott W.G. Scheduling production activities in multi-stage batch manufacturing systems. International Journal of Production Research. 23:(2):1985;315-328.
33. Uckun S., Bagchi S., Kawamura K., Miyabe Y. Managing genetic search in job shop scheduling. IEEE Expert. 8:(5):1993;15-24.
34. Vickson R.G. Optimal lot streaming for multiple products in a two-machine flow shop. European Journal of Operational Research. 85:1995;556-575.