Multiobjective flexible job shop scheduling using memetic algorithms

IEEE Transactions on Automation Science and Engineering

Volumn 12, Issue 1, 2015, Pages 336-353

  Yuan, Yuan ^a   Xu, Hua ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

Flexible job shop scheduling; local search; memetic algorithm (MA); mutliobjective; nondominated sorting genetic algorithm II (NSGA II)

Indexed keywords

BENCHMARKING; GENETIC ALGORITHMS; LOCAL SEARCH (OPTIMIZATION); PARETO PRINCIPLE; SCHEDULING; SCHEDULING ALGORITHMS;

FLEXIBLE JOB-SHOP SCHEDULING; LOCAL SEARCH; MEMETIC ALGORITHMS; MUTLIOBJECTIVE; NON DOMINATED SORTING GENETIC ALGORITHM II (NSGA II);

JOB SHOP SCHEDULING;

EID: 84920780405     PISSN: 15455955     EISSN: None     Source Type: Journal    
DOI: 10.1109/TASE.2013.2274517     Document Type: Article

References (59)

1. M. Garey, D. Johnson, and R. Sethi, "The complexity of flowshop and jobshop scheduling," Math. Oper. Res., vol. 1, no. 2, pp. 117-129, 1976.
2. P. Brandimarte, "Routing and scheduling in a flexible job shop by tabu search," Ann. Oper. Res., vol. 41, no. 3, pp. 157-183, 1993.
3. M. Mastrolilli and L. Gambardella, "Effective neighbourhood functions for the flexible job shop problem," J. Scheduling, vol. 3, no. 1, pp. 3-20, 2000.
4. N. Ho, J. Tay, and E. Lai, "An effective architecture for learning and evolving flexible job-shop schedules," Eur. J. Oper. Res., vol. 179, no. 2, pp. 316-333, 2007.
5. F. Pezzella, G. Morganti, and G. Ciaschetti, "A genetic algorithm for the flexible job-shop scheduling problem," Comput. Oper. Res., vol. 35, no. 10, pp. 3202-3212, 2008.
6. W. Boejko, M. Uchroski, and M. Wodecki, "Parallel hybrid metaheuristics for the flexible job shop problem," Comput. Indu. Eng., vol. 59, no. 2, pp. 323-333, 2010.
7. A. Ben Hmida,M. Haouari,M.-J. Huguet, and P. Lopez, "Discrepancy search for the flexible job shop scheduling problem," Comput. Oper. Res., vol. 37, no. 12, pp. 2192-2201, 2010.
8. Y. Yuan, H. Xu, and J. Yang, "A hybrid harmony search algorithm for the flexible job shop scheduling problem," Appl. Soft Comput., vol. 13, no. 7, pp. 3259-3272, 2013.
9. Y. Yuan and H. Xu, "An integrated search heuristic for large-scale flexible job shop scheduling problems," Comput. Oper. Res., vol. 40, no. 12, pp. 2864-2877, 2013.
10. W. Xia and Z. Wu, "An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems," Comput. Ind. Eng., vol. 48, no. 2, pp. 409-425, 2005.
11. H. Liu, A. Abraham, O. Choi, and S. Moon, "Variable neighborhood particle swarm optimization for multi-objective flexible job-shop scheduling problems," Simulated Evolution and Learning, pp. 197-204, 2006.
12. J. Gao, M. Gen, L. Sun, and X. Zhao, "A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems," Comput. Ind. Eng., vol. 53, no. 1, pp. 149-162, 2007.
13. G. Zhang, X. Shao, P. Li, and L. Gao, "An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem," Comput. Ind. Eng., vol. 56, no. 4, pp. 1309-1318, 2009.
14. L. Xing, Y. Chen, and K. Yang, "An efficient search method for multiobjective flexible job shop scheduling problems," J. Intell.Manuf., vol. 20, no. 3, pp. 283-293, 2009.
15. J. Li, Q. Pan, andY. Liang, "An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems," Comput. Ind. Eng., vol. 59, no. 4, pp. 647-662, 2010.
16. 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. Simulation, vol. 60, no. 3, pp. 245-276, 2002.
17. N. Ho and J. Tay, "Solving multiple-objective flexible job shop problems by evolution and local search," IEEE Trans. Syst., Man, Cybern., Part C: Appl. Rev., vol. 38, no. 5, pp. 674-685, 2008.
18. M. Frutos, A. Olivera, and F. Tohmé, "A memetic algorithm based on a nsgaii scheme for the flexible job-shop scheduling problem," Ann. Oper. Res., vol. 181, no. 1, pp. 745-765, 2010.
19. K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, "A fast and elitist multiobjective genetic algorithm: NSGA-II," IEEE Trans. Evol. Comput., vol. 6, no. 2, pp. 182-197, 2002.
20. X. Wang, L. Gao, C. Zhang, and X. Shao, "A multi-objective genetic algorithm based on immune and entropy principle for flexible job-shop scheduling problem," Int. J. Adv. Manuf. Technol., vol. 51, no. 5, pp. 757-767, 2010.
21. G. Moslehi and M. Mahnam, "A pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search," Int. J. Prod. Econ., vol. 129, no. 1, pp. 14-22, 2011.
22. J. Li, Q. Pan, and K. Gao, "Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems," Int. J. Adv. Manuf. Technol., vol. 55, no. 9, pp. 1159-1169, 2011.
23. J. Li, Q. Pan, and S. Xie, "An effective shuffled frog-leaping algorithm formulti-objective flexible job shop scheduling problems," Appl. Math. Comput., vol. 218, no. 18, pp. 9353-9371, 2012.
24. J. Li, Q. Pan, and J. Chen, "A hybrid pareto-based local search algorithm for multi-objective flexible job shop scheduling problems," Int. J. Prod. Res., vol. 50, no. 4, pp. 1063-1078, 2012.
25. 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.Manuf. Technol., vol. 60, no. 9, pp. 1111-1123, 2012.
26. S. Rahmati, M. Zandieh, and M. Yazdani, "Developing two multiobjective evolutionary algorithms for the multi-objective flexible job shop scheduling problem," Int. J. Adv. Manuf. Technol., In press.
27. M. Rabiee, M. Zandieh, and P. Ramezani, "Bi-objective partial flexible job shop scheduling problem: NSGA-II, NRGA, MOGA and PAES approaches," Int. J. Prod. Res., vol. 50, no. 24, pp. 7327-7342, 2012.
28. J. Xiong, X. Tan, K. Yang, L. Xing, and Y. Chen, "A hybridmultiobjective evolutionary approach for flexible job-shop scheduling problems," Math. Problems Eng., vol. 2012, Article ID 478981, 27 pages, 2012, doi:10.1155/2012/478981.
29. T. Chiang and H. Lin, "A simple and effective evolutionary algorithm for multiobjective flexible job shop scheduling," Int. J. Prod. Econ., vol. 141, no. 1, pp. 87-98, 2013.
30. T. Chiang and H. Lin, "Flexible job shop scheduling using a multiobjective memetic algorithm," Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence, pp. 49-56, 2012.
31. H. Ishibuchi, T. Yoshida, and T. Murata, "Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling," IEEE Trans. Evol. Comput., vol. 7, no. 2, pp. 204-223, 2003.
32. G. Minella, R. Ruiz, and M. Ciavotta, "A review and evaluation of multiobjective algorithms for the flowshop scheduling problem," INFORMS J. Comput., vol. 20, no. 3, pp. 451-471, 2008.
33. Y. Mei, K. Tang, and X. Yao, "Decomposition-based memetic algorithm for multiobjective capacitated arc routing problem," IEEE Trans. Evol. Comput., vol. 15, no. 2, pp. 151-165, 2011.
34. L. Ke, Q. Zhang, and R. Battiti, "MOEA/D-ACO: A multiobjective evolutionary algorithm using decomposition and ant colony," IEEE Trans. Cybern., in press.
35. B. Roy and B. Sussmann, "Les problemes dordonnancement avec contraintes disjonctives," Note ds, vol. 9, 1964.
36. M. Pinedo, Scheduling: Theory, Algorithms, Systems. NewYork,NY, USA: Springer, 2012.
37. N. Krasnogor and J. Smith, "A tutorial for competent memetic algorithms: Model, taxonomy, design issues," IEEE Trans. Evol. Comput., vol. 9, no. 5, pp. 474-488, 2005.
38. Y. Ong and A. Keane, "Meta-lamarckian learning in memetic algorithms," IEEE Trans. Evolutionary Computation, vol. 8, no. 2, pp. 99-110, 2004.
39. Y. Ong, M. Lim, N. Zhu, and K. Wong, "Classification of adaptive memetic algorithms: A comparative study," IEEE Trans. Syst., Man, Cybern., Part B: Cybern., vol. 36, no. 1, pp. 141-152, 2006.
40. H. Ishibuchi and K. Narukawa, "Some issues on the implementation of local search in evolutionary multiobjective optimization," in Genetic and Evol. Comput., GECCO'04, 2004, pp. 1246-1258.
41. H. Ishibuchi and T. Murata, "A multi-objective genetic local search algorithm and its application to flowshop scheduling," IEEE Trans. Syst., Man, Cybern., Part C: Appl. Rev., vol. 28, no. 3, pp. 392-403, 1998.
42. K. Sindhya,K.Deb, and K. Miettinen, "Improving convergence of evolutionary multi-objective optimization with local search: A concurrenthybrid algorithm," Natural Comput., vol. 10, no. 4, pp. 1407-1430, 2011.
43. H. Ishibuchi, Y. Hitotsuyanagi, and Y. Nojima, "An empirical study on the specification of the local search application probability in multiobjective memetic algorithms," in Proc. IEEE Congr. Evol. Comput, CEC'07, 2007, pp. 2788-2795.
44. H. Ishibuchi, Y. Hitotsuyanagi, N. Tsukamoto, and Y. Nojima, "Use of heuristic local search for single-objective optimization in multiobjective memetic algorithms," Parallel Problem Solving from Nature-PPSN X, pp. 743-752, 2008.
45. D. Garrett and D. Dasgupta, "An empirical comparison of memetic algorithm strategies on the multiobjective quadratic assignment problem," in Proc. IEEE Symp. Comput. Intell. Miulti-Criteria Decision-Making, MCDM'09, 2009, pp. 80-87.
46. R. Cheng, M. Gen, and Y. Tsujimura, "A tutorial survey of job-shop scheduling problems using genetic algorithms?i. representation," Comput. Ind. Eng., vol. 30, no. 4, pp. 983-997, 1996.
47. I. Oliver, D. Smith, and J. Holland, "A study of permutation crossover operators on the traveling salesman problem," in Proc. 2nd Int. Conf. Genetic Algorithms on Genetic Algorithms and Their Appl., 1987, pp. 224-230.
48. 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., vol. 70, no. 0, pp. 281-306, Apr. 1997.
49. J. Hurink, B. Jurisch, and M. Thole, "Tabu search for the job-shop scheduling problem with multi-purpose machines," OR Spectrum, vol. 15, no. 4, pp. 205-215, 1994.
50. C. Coello and N. Cortés, "Solving multiobjective optimization problems using an artificial immune system," Genetic Programming and Evolvable Machines, vol. 6, no. 2, pp. 163-190, 2005.
51. E. Zitzler, K. Deb, and L. Thiele, "Comparison of multiobjective evolutionary algorithms: Empirical results," Evol. Comput., vol. 8, no. 2, pp. 173-195, 2000.
52. J. Dem͉ar, "Statistical comparisons of classifiers over multiple data sets," J. Machine Learning Res., vol. 7, pp. 1-30, 2006.
53. J. C. Beck, T. Feng, and J.-P.Watson, "Combining constraint programming and local search for job-shop scheduling," INFORMS J. Comput., vol. 23, no. 1, pp. 1-14, 2011.
54. D. Sha and C.-Y. Hsu, "A hybrid particle swarm optimization for job shop scheduling problem," Computer. Ind. Eng., vol. 51, no. 4, pp. 791-808, 2006.
55. C. Y. Zhang, P. Li, Y. Rao, and Z. Guan, "A very fast TS/SA algorithm for the job shop scheduling problem," Comput. Oper. Res., vol. 35, no. 1, pp. 282-294, 2008.
56. M. Laumanns, L. Thiele, K. Deb, and E. Zitzler, "Combining convergence and diversity in evolutionary multiobjective optimization," Evol. Comput., vol. 10, no. 3, pp. 263-282, 2002.
57. B. Qian, L. Wang, D.-X. Huang, W.-L. Wang, and X. Wang, "An effective hybrid de-based algorithm for multi-objective flow shop scheduling with limited buffers," Comput. Oper. Res., vol. 36, no. 1, pp. 209-233, 2009.
58. R. Qing-Dao-Er-Ji, Y. Wang, and X. Wang, "Inventory based two-objective job shop scheduling model and its hybrid genetic algorithm," Appl. Soft Comput., vol. 13, no. 3, pp. 1400-1406, 2013.
59. B. Alidaee and H. Li, "Parallel machine selection and job scheduling to minimize sum of machine holding cost, total machine time costs, total tardiness costs," IEEE Trans. Autom. Sci. Eng., to be published.