Bi-objective scheduling for reentrant hybrid flow shop using Pareto genetic algorithm

Computers and Industrial Engineering

Volumn 61, Issue 3, 2011, Pages 529-541

  Cho, Hang Min ^a   Bae, Suk Joo ^a   Kim, Jungwuk ^b   Jeong, In Jae ^a  

^a Hanyang University   (South Korea)

^b Samsung SDS   (South Korea)

Author keywords

NSGA II; Pareto genetic algorithm; Reentrant hybrid flowshop

Indexed keywords

BI-OBJECTIVE SCHEDULING; CROSSOVER OPERATOR; DISTANCE-BASED; FLOW-SHOPS; HYBRID FLOW SHOP; IDENTICAL PARALLEL MACHINES; LOCAL SEARCH; MAKESPAN; MINKOWSKI; MULTI-OBJECTIVE GENETIC ALGORITHM; NSGA-II; OPTIMAL SOLUTIONS; PARETO GENETIC ALGORITHMS; PARETO OPTIMAL SOLUTIONS; REENTRANT HYBRID FLOWSHOP; SCHEDULING PROBLEM; TOTAL TARDINESS;

BUSINESS MACHINES; OPTIMAL SYSTEMS; PARETO PRINCIPLE; SCHEDULING ALGORITHMS;

GENETIC ALGORITHMS;

EID: 80053189252     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2011.04.008     Document Type: Article

References (27)

1. J.E. Arroyo, and V.A. Armentano Genetic local search for multi-objective flowshop scheduling problems European Journal of Operational Research 167 2005 717 738 (Pubitemid 40220087)
2. S. Bertel, and J.C. Billaut A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation European Journal of Operational Research 159 2004 651 662
3. C.L. Chen, and B.L. Bulfin Complexity of single machine, multi-criteria scheduling problems European Journal of Operational Research 70 1993 115 125
4. S.-W. Choi, Y.-D. Kim, and G-C. Lee Minimizing total tardiness of orders with reentrant lots in a hybrid flow shop International Journal of Production Research 43 2005 2149 2167 (Pubitemid 41663544)
5. K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan A fast and elitist multiobjective genetic algorithm: NSGA-II IEEE Transactions on Evolutionary Computation 6 2 2002 182 197 (Pubitemid 34555372)
6. I.G. Drobouchevitch, and V.A. Strusevich A heuristic algorithm for two-machine reentrant shop scheduling Annals of Operations Research 86 1999 417 439
7. Davis, L. (1985). Applying adaptive algorithm to epistatic domains. In Proceeding of the international joint conference on artificial intelligence (pp. 162-164).
8. C. Fonseca, and P. Fleming An overview of evolutionary algorithms in multiobjective optimization Evolutionary Computation 3 1 1995 1 16
9. T.D. Fry, R.D. Armstrong, and H. Lewis A framework for single machine multiple objective sequencing research Omega 17 6 1989 595 607
10. D. Goldberg Genetic algorithm in search Optimization and machine learning 1989 Addison-Wesley Reading, MA
11. R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan Optimization and approximation in deterministic sequencing and scheduling: A survey Annals of Discrete Mathematics 5 1979 287 326
12. S.C. Graves, H.C. Meal, D. Stefek, and A.H. Zeghmi Scheduling of reentrant flow shops Journal of Operations Management 3 4 1983 197 207
13. A.G.P. Guinet, and M.M. Solomon Scheduling hybrid flow shops to minimize maximum tardiness or maximum completion time International Journal of Production Research 34 1996 1643 1654 (Pubitemid 126519773)
14. J. N.D. Gupta, and E.A. Tunc Minimizing tardy jobs in a two-stage hybrid flow shop International Journal of Production Research 36 1998 2397 2417 (Pubitemid 128670856)
15. Hsu, C.; & Shamma, J. S. (1997). Receding horizon control for manufacturing systems. In Proceedings of the American control conference (pp. 1914-1918).
16. H. Ishibuchi, T. Yoshida, and T. Murata Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling IEEE Transactions on Evolutionary Computation 7 2 2003 204 223
17. B. Kim, E.S. Gel, J.W. Fowler, W.M. Carlyle, and J. Wallenius Evaluation of nondominated solution sets for K-objective optimization problems: An exact method and approximations European Journal of Operational Research 173 2 2006 565 582
18. Y.H. Lee, and B. Lee Push-pull production planning of the re-entrant process International Journal Advanced Manufacturing Technology 22 2003 931 992
19. R. Linn, and W. Zhang Hybrid flow shop scheduling Computers and Industrial Engineering 37 1999 57 61
20. Mason, S. J.; Kurz, M. E.; Pfund, M. E, & Fowler, J. W. (2007). Multi-objective semiconductor manufacturing scheduling: A random keys implementation of NSGA-II. In Proceedings of the 2007 IEEE symposium on computational intelligence in scheduling (pp. 159-164). (Pubitemid 47431196)
21. A. Nagar, J. Haddock, and S. Heragu Multiple and bicriteria scheduling: A literature survey European Journal of Operational Research 81 1995 88 104
22. I.M. Ovacik, and R. Uzsoy Exploiting shop floor status information to schedule complex job shops Journal of Manufacturing Systems 13 1994 73 84
23. J.C.H. Pan, and J.S. Chen Minimizing makespan in re-entrant permutation flow-shops Journal of the Operational Research Society 54 2003 642 653
24. J.C.H. Pan, and J.S. Chen Mixed binary integer programming formulations for the reentrant job shop scheduling problem Computers and Operations Research 32 2005 1197 1212
25. N. Srinivas, and K. Deb Multi-objective function optimization using non-dominated sorting genetic algorithms Evolutionary Computation 2 1995 221 248
26. F.D. Vargas-Villamil, D.E. Rivera, and K.G. Kempf A hierarchical approach to production control of reentrant semiconductor manufacturing lines IEEE Transactions on Control Systems Technology 11 4 2003 578 587
27. M.Y. Wang, S.P. Sethi, and S.L. Van de Velde Minimizing makespan in a class of reentrant shops Operations Research 45 1997 702 712 (Pubitemid 127684742)