Path-relinking Tabu search for the multi-objective flexible job shop scheduling problem

Computers and Operations Research

Volumn 47, Issue , 2014, Pages 11-26

  Jia, Shuai ^a   Hu, Zhi Hua ^a,b  

^a SHANGHAI MARITIME UNIVERSITY   (China)

^b TONGJI UNIVERSITY   (China)

Author keywords

Flexible job shop scheduling; Multi objective optimization; Path relinking; Tabu search

Indexed keywords

EID: 84894582828     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2014.01.010     Document Type: Article

References (37)

1. M.R. Garey, D.S. Johnson, and R. Sethi The complexity of flow shop and job shop scheduling Math Oper Res 1 2 1976 117 129
2. J. Błażewicz, W. Domschke, and E. Pesch The job shop scheduling problem: conventional and new solution techniques Eur J Oper Res 93 1996 1 33
3. T.C. Chiang, and H.J. Lin A simple and effective evolutionary algorithm for multiobjective flexible job shop scheduling Int J Prod Econ 141 1 2013 87 98
4. P. Brandimarte Routing and scheduling in a flexible job shop by tabu search Ann Oper Res 41 3 1993 157 183
5. I. Kacem, S. Hammadi, and P. Borne Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems IEEE Trans Syst Man Cybernet, Part C 32 1 2002 408 419
6. E. Nowicki, and C. Smutnicki A fast taboo search algorithm for the job shop problem Manage Sci 42 6 1996 797 813
7. P. Brucker, and R. Schlie Job-shop scheduling with multi-purpose machines Computing 45 4 1990 369 375
8. J. Hurink, B. Jurisch, and M. Thole Tabu search for the job-shop scheduling problem with multi-purpose machines OR Spektrum 15 4 1994 205 215
9. M. Mastrolilli, and L.M. Gambardella Effective neighborhood functions for the flexible job shop problem J Sched 3 1 2000 3 20
10. I. Kacem, S. Hammadi, and P. Borne Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic Math Comput Simul 60 3-5 2002 245 276
11. Ho NB, Tay JC. GENACE: an efficient cultural algorithm for solving the flexible job-shop problem. In: Proceedings of the IEEE congress on evolutionary computation, vol. 2; 2004;. p. 1759-66.
12. F. Pezzella, G. Morganti, and G. Ciaschetti A genetic algorithm for the flexible job-shop scheduling problem Comput Oper Res 35 10 2008 3202 3212
13. N.B. Ho, J.C. Tay, and E.M.-K. Lai An effective architecture for learning and evolving flexible job-shop schedules Eur J Oper Res 179 2 2007 316 333
14. J. Gao, L. Sun, and M. Gen A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems Comput Oper Res 35 9 2008 2892 2907
15. G.H. Zhang, L. Gao, and Y. Shi An effective genetic algorithm for the flexible job-shop scheduling problem Expert Syst Appl 38 4 2011 3563 3573
16. L. Wang, S. Wang, Y. Xu, G. Zhou, and M. Liu A bi-population based estimation of distribution algorithm for the flexible job-shop scheduling problem Comput Ind Eng 62 4 2012 917 926
17. G.H. Zhang, X.Y. Shao, P.G. Li, and L. Gao An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem Comput Ind Eng 56 4 2009 1309 1318
18. G. Moslehi, and M.A. Mahnam Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search Int J Prod Econ 129 1 2011 14 22
19. A. Bagheri, M. Zandieh, I. Mahdavi, and M. Yazdani An artificial immune algorithm for the flexible job-shop scheduling problem Future Gener Comput Syst 26 4 2010 533 541
20. W.J. Xia, and Z.M. Wu An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems Comput Ind Eng 48 2 2005 409 425
21. L.N. Xing, Y.W. Chen, and K.W. Yang Multi-objective flexible job shop schedule: design and evaluation by simulation modeling Appl Soft Comput 9 1 2009 362 376
22. A. BenHmida, M. Haouari, M.J. Huguet, and Lopez Pierre. Discrepancy search for the flexible job shop scheduling problem Comput Oper Res 37 2010 2192 2201
23. J.Q. Li, Q.K. Pan, and S.X. Xie An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems Appl Math Comput 218 18 2012 9353 9371
24. W. Teekeng, and A.A. Thammano Combination of shuffled frog leaping and fuzzy logic for flexible job-shop scheduling problems Proc Comput Sci 6 2011 69 75
25. Y. Yuan, H. Xu, and J.D. Yang A hybrid harmony search algorithm for the flexible job shop scheduling problem Appl Soft Comput 13 7 2013 3259 3272
26. M. Yazdani, M. Amiri, and M. Zandieh Flexible job-shop scheduling with parallel variable neighborhood search algorithm Expert Syst Appl 37 1 2010 678 687
27. W. Bożejko, M. Uchroński, and M. Wodecki Parallel hybrid metaheuristics for the flexible job shop problem Comput Ind Eng 59 2 2010 323 333
28. N.B. Ho, and J.C. Tay Solving multiple-objective flexible job shop problems by evolution and local search IEEE Trans Syst Man Cybernet, Part C 38 5 2008 674 685
29. K. Deb, A. Pratap, S. Agarwal, and Meyarivan TA Fast and elitist multiobjective genetic algorithm: NSGA-II IEEE Trans Evolut Comput 6 2 2002 182 197
30. X.J. Wang, L. Gao, C.Y. Zhang, and X.Y. Shao A multi-objective genetic algorithm based on immune and entropy principle for flexible job-shop scheduling problem Int J Adv Manufact Technol 51 5-8 2010 757 767
31. E. Zitzler, and L. Thiele Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach IEEE Trans Evolut Comput 3 4 1999 257 271
32. J.Q. Li, Q.K. Pan, and K.Z. Gao Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems Int J Adv Manufact Technol 55 9-12 2011 1159 1169
33. L. Wang, G. Zhou, Y. Xu, and M. Liu An enhanced Pareto-based artificial bee colony algorithm for the multi-objective flexible job-shop scheduling Int J Adv Manufact Technol 60 9-12 2012 1111 1123
34. D.M. Jaeggi, G.T. Parks, T. Kipouros, and P.J. Clarkson The development of a multi-objective Tabu search algorithm for continuous optimisation problems Eur J Oper Res 185 3 2008 1192 1212
35. A.B. Hmida, M. Haouari, M.J. Huguet, and Lopez Pierre Discrepancy search for the flexible job shop scheduling problem Comput Oper Res 37 12 2010 2192 2201
36. J.Q. Li, Q.K. Pan, and Y.C. Liang An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems Comput Ind Eng 59 4 2010 647 662
37. S. Dauzère-Pérès, and J. Paulli An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search Ann Oper Res 70 0 1997 281 306