A hybrid genetic algorithm/mathematical programming approach to the multi-family flowshop scheduling problem with lot streaming

Omega

Volumn 37, Issue 1, 2009, Pages 126-137

  Martin, Clarence H ^a  

^a OHIO UNIVERSITY   (United States)

Author keywords

Flow shop; Heuristics; Mathematical programming; Search procedure; Sequencing

Indexed keywords

EID: 44849088760     PISSN: 03050483     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.omega.2006.11.002     Document Type: Article

References (22)

1. Rinnooy Kan A.H.G. Machine scheduling problems: classification, complexity, and computations (1976), Martinus Nijhoff, The Hague
2. Gupta J.N.D., and Stafford Jr. E.F. Flowshop scheduling research after five decades. European Journal of Operational Research 169 (2006) 699-711
3. Allahverdi A., Gupta J.N.D., and Aldowaisan T. A review of scheduling research involving setup considerations. Omega 27 (1999) 219-239
4. Trietsch D., and Baker K.R. Basic techniques for lot streaming. Operations Research 41 6 (1993) 1065-1076
5. Yoon S.H., and Ventura J.A. An application of genetic algorithms to lot-streaming flow shop scheduling. IIE Transactions 34 9 (2002) 779-787
6. Huq F., Cutright K., and Martin C. Employee scheduling and makespan minimization in a flow shop with multi-processor work stations: a case study. Omega 32 (2004) 121-129
7. Sen A., Topaloǧlu E., and Benli O. Optimal streaming of a single job in a two-stage flow shop. European Journal of Operational Research 110 (1998) 42-62
8. Sriskandarajah C., and Wagneur E. Lot streaming and scheduling multiple products in two-machine no-wait flow shops. IIE Transactions 31 8 (1999) 695-707
9. Potts C.N., and 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
10. Crauwels H.A.J., Potts C.N., and Van Wassenhove L.N. Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs. European Journal of Operational Research 90 (1996) 200-213
11. Holland JH. Adaptation in natural and artificial systems. Cambridge, MA, Ann Arbor, MI: University of Michigan Press, 1975. Cambridge, MA: MIT Press, 1992.
12. Houpt R.L., and Houpt S.E. Practical genetic algorithms (1998), Wiley, New York, NY
13. Chen C., Vempati V.S., and Aljaber N. An application of genetic algorithms for flow shop problems. European Journal of Operational Research 80 (1995) 389-396
14. Reeves C.R. A genetic algorithm for flow shop sequencing. Computers and Operations Research 22 1 (1995) 5-13
15. Prins C. Competitive genetic algorithms for the open-shop scheduling problem. Mathematical Methods of Operations Research 52 (2000) 389-411
16. Lee S.M., and Asllani A.A. Job scheduling with dual criteria and sequence-dependent setups: mathematical versus genetic programming. Omega 32 (2004) 145-153
17. Aldowaisan T., and Allahverdi A. New heuristics for m-machine no-wait flow shop to minimize total completion time. Omega 32 (2004) 345-352
18. Ruiz R., Maroto C., and Alcaraz. Two new robust genetic algorithms for the flowshop scheduling problem. Omega 34 (2006) 461-476
19. Tseng F.T., Stafford Jr. E.F., and Gupta J.N.D. An empirical analysis of integer programming formulations for the permutation flowshop. Omega 32 (2004) 285-293
20. Amar A.D., and Gupta J.N.D. Simulated versus real-life data in testing the efficiency of scheduling algorithms. IIE Transactions 18 xx (1986) 16-25
21. Hall N., and Posner M. Generating experimental data for computational testing with machine scheduling applications. Operations Research 49 7 (2001) 854-865
22. Balas E. The prize collecting traveling salesman problem. Networks 19 (1989) 621-636