Automatic design of scheduling policies for dynamic multi-objective job shop scheduling via cooperative coevolution genetic programming

IEEE Transactions on Evolutionary Computation

Volumn 18, Issue 2, 2014, Pages 193-208

  Nguyen, Su ^a   Zhang, Mengjie ^a   Johnston, Mark ^a   Tan, Kay Chen ^b  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Dispatching rule (DR); genetic programming (GP); hyperheuristic; job shop scheduling (JSS)

Indexed keywords

DESIGN; EVOLUTIONARY ALGORITHMS; SCHEDULING;

COOPERATIVE CO-EVOLUTION; DISPATCHING RULES; HYPERHEURISTIC; JOB-SHOP SCHEDULING; MULTI OBJECTIVE EVOLUTIONARY ALGORITHMS; MULTI-OBJECTIVE JOB SHOP SCHEDULING; NON-DOMINATED SORTING GENETIC ALGORITHM - II; STRENGTH PARETO EVOLUTIONARY ALGORITHM;

GENETIC PROGRAMMING;

EID: 84897519903     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2013.2248159     Document Type: Article

References (79)

1. I. Ahmed and W. W. Fisher, "Due date assignment, job order release, and sequencing interaction in job shop scheduling," Decis. Sci., vol. 23, no. 3, pp. 633-647, 1992.
2. P. M. Pardalos, O. V. Shylo, and A. Vazacopoulos, "Solving job shop scheduling problems utilizing the properties of backbone and 'big valley'," Comput. Optim. Appl., vol. 47, no. 1, pp. 61-76, 2010.
3. R. M. Aiex, S. Binato, and M. G. C. Resende, "Parallel GRASP with path-relinking for job shop scheduling," J. Parallel Comput., vol. 29, no. 4, pp. 393-430, Apr. 2003.
4. H. R. Lourenco, "Job-shop scheduling: Computational study of local search and large-step optimization methods," Eur. J. Oper. Res., vol. 83, no. 2, pp. 347-364, 1995.
5. E. Balas, N. Simonetti, and A. Vazacopoulos, "Job shop scheduling with setup times, deadlines and precedence constraints," J. Scheduling, vol. 11, no. 4, pp. 253-262, 2008.
6. E. Balas and A. Vazacopoulos, "Guided local search with shifting bottleneck for job shop scheduling," Manage. Sci., vol. 44, no. 2, pp. 262-275, 1998. (Pubitemid 128596865)
7. M. L. Pinedo and M. Singer, "A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop," Naval Res. Logistics, vol. 46, no. 1, pp. 1-17, 1999.
8. S. Kreipl, "A large step random walk for minimizing total weighted tardiness in a job shop," J. Scheduling, vol. 3, no. 3, pp. 125-138, 2000.
9. T. C. E. Cheng and M. C. Gupta, "Survey of scheduling research involving due date determination decisions," Eur. J. Oper. Res., vol. 38, no. 2, pp. 156-166, 1989.
10. G. L. Ragatz and V. A. Mabert, "A simulation analysis of due date assignment rules," J. Oper. Manage., vol. 5, no. 1, pp. 27-39, 1984.
11. K. R. Baker, "Sequencing rules and due-date assignments in a job shop," Manage. Sci., vol. 30, no. 9, pp. 1093-1104, 1984.
12. S. Miyazaki, "Combined scheduling system for reducing job tardiness in a job shop," Int. J. Prod. Res., vol. 19, no. 2, pp. 201-211, 1981. (Pubitemid 12553037)
13. T. C. E. Cheng, "Integration of priority dispatching and due-date assignment in a job shop," Int. J. Syst. Sci., vol. 19, no. 9, pp. 1813-1825, 1988. (Pubitemid 18664389)
14. J. R. Koza, Genetic Programming: On the Programming of Computers by Means of Natural Selection. Cambridge, MA USA: MIT Press, 1992.
15. W. Banzhaf, P. Nordin, R. Keller, and F. Francone, Genetic Programming: An Introduction. San Francisco, CA, USA: Morgan Kaufmann, 1998.
16. S. Smith, "Cartesian genetic programming and its application to medical diagnosis," IEEE Comput. Intell. Mag., vol. 6, no. 4, pp. 56-67, Nov. 2011.
17. A. Song, Q. Shi, and W. Yin, "Understanding of GP-evolved motion detectors," IEEE Comput. Intell. Mag., vol. 8, no. 1, pp. 46-55, Feb. 2013.
18. T. Hildebrandt, J. Heger, and B. Scholz-Reiter, "Toward improved dispatching rules for complex shop floor scenarios: A genetic programming approach," in Proc. 12th Annu. Conf. Genetic Evol. Comput., 2010, pp. 257-264.
19. D. Jakobovic, L. Jelenkovic, and L. Budin, "Genetic programming heuristics for multiple machine scheduling," in Proc. 10th Eur. Conf. Genetic Program., 2007, pp. 321-330. (Pubitemid 47290323)
20. J. C. Tay and N. B. Ho, "Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems," Comput. Ind. Eng., vol. 54, no. 3, pp. 453-473, 2008. (Pubitemid 351199798)
21. C. D. Geiger and R. Uzsoy, "Learning effective dispatching rules for batch processor scheduling," Int. J. Prod. Res., vol. 46, no. 6, pp. 1431-1454, 2008. (Pubitemid 350157675)
22. C. Pickardt, J. Branke, T. Hildebrandt, J. Heger, and B. Scholz- Reiter, "Generating dispatching rules for semiconductor manufacturing to minimize weighted tardiness," in Proc. Winter Simul. Conf., 2010, pp. 2504-2515.
23. S. Nguyen, M. Zhang, M. Johnston, and K. C. Tan, "Learning iterative dispatching rules for job shop scheduling with genetic programming," Int. J. Adv. Manuf. Technol., pp. 1-16, 2013.
24. S. Nguyen, M. Zhang, M. Johnston, and K. Tan, "A computational study of representations in genetic programming to evolve dispatching rules for the job shop scheduling problem," IEEE Trans. Evol. Comput., vol. pp, no. 99, pp. 1-1, 2012.
25. E. K. Burke, M. Hyde, G. Kendall, G. Ochoa, E. Ozcan, and R. Qu, "Hyper-heuristics: A survey of the state of the art," School of Computer Science and Information Technology, Univ. Nottingham, Nottingham, U.K., Comput. Sci. Tech. Rep. NOTTCS-TR-SUB-0906241418-2747, 2010.
26. E. Burke, M. Hyde, G. Kendall, G. Ochoa, E. Ozcan, and J. Woodward, "Exploring hyper-heuristic methodologies with genetic programming," in Computational Intelligence (Intelligent Systems Reference Library Series), vol. 1, C. Mumford and L. Jain, Eds. Berlin, Germany: Springer, 2009, pp. 177-201.
27. D. A.van Veldhuizen and G. B. Lamont, "Multi-objective evolutionary algorithm research: A history and analysis," Dept. Elect. Comput. Eng., Air Force Institute of Technology, Wright Patterson AFB, Dayton, OH, USA, Tech. Rep. TR-98-03, 1998.
28. E. Zitzler and L. Thiele, "Multi-objective evolutionary algorithms: A comparative case study and the strength Pareto approach," IEEE Trans. Evol. Comput., vol. 3, no. 4, pp. 257-271, Nov. 1999. (Pubitemid 30544879)
29. K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, "A fast and elitist multi-objective genetic algorithm: NSGA-II," IEEE Trans. Evol. Comput., vol. 6, no. 2, pp. 182-197, Apr. 2002. (Pubitemid 34555372)
30. D. Wojtaszek and S. Wesolkowski, "Military fleet mix computation and analysis," IEEE Comput. Intell. Mag., vol. 7, no. 3, pp. 53-61, Aug. 2012.
31. C. H. Chen, T. K. Liu, I. M. Huang, and J. H. Chou, "Multiobjective synthesis of six-bar mechanisms under manufacturing and collision-free constraints," IEEE Comput. Intell. Mag., vol. 7, no. 1, pp. 36-48, Feb. 2012.
32. R. Ramasesh, "Dynamic job shop scheduling: A survey of simulation research," Omega, vol. 18, no. 1, pp. 43-57, 1990.
33. S. Nguyen, M. Zhang, M. Johnston, and K. C. Tan, "Evolving reusable operation-based due-date assignment models for job shop scheduling with genetic programming," in Proc. 15th Eur. Conf. Genetic Program., 2012, pp. 121-133.
34. T. D. Fry, P. R. Philipoom, and R. E. Markland, "Due date assignment in a multistage job shop," IIE Trans., vol. 21, no. 2, pp. 153-161, 1989.
35. P. R. Philipoom, L. P. Rees, and L. Wiegmann, "Using neural networks to determine internally-set due-date assignments for shop scheduling," Decis. Sci., vol. 25, nos. 5-6, pp. 825-851, 1994.
36. F.-C. R. Chang, "A study of due-date assignment rules with constrained tightness in a dynamic job shop," Comput. Ind. Eng., vol. 31, nos. 1-2, pp. 205-208, 1996. (Pubitemid 126380019)
37. T. C. E. Cheng and J. Jiang, "Job shop scheduling for missed duedate performance," Comput. Ind. Eng., vol. 34, no. 2, pp. 297-307, 1998. (Pubitemid 128458239)
38. I. Sabuncuoglu and A. Comlekci, "Operation-based flowtime estimation in a dynamic job shop," Omega, vol. 30, no. 6, pp. 423-442, 2002.
39. D. Sha and S. Hsu, "Due-date assignment in wafer fabrication using artificial neural networks," Int. J. Adv. Manuf. Technol., vol. 23, nos. 9-10, pp. 768-775, 2004.
40. A. Ozturk, S. Kayaligil, and N. E. Ozdemirel, "Manufacturing lead time estimation using data mining," Eur. J. Oper. Res., vol. 173, no. 2, pp. 683-700, 2006.
41. D. Sha and C.-H. Liu, "Using data mining for due date assignment in a dynamic job shop environment," Int. J. Adv. Manuf. Technol., vol. 25, nos. 11-12, pp. 1164-1174, 2005. (Pubitemid 40683676)
42. D. Y. Sha, R. L. Storch, and C. H. Liu, "Development of a regressionbased method with case-based tuning to solve the due date assignment problem," Int. J. Prod. Res., vol. 45, no. 1, pp. 65-82, 2007. (Pubitemid 44837913)
43. A. Baykasoglu, M. Gocken, and Z. D. Unutmaz, "New approaches to due date assignment in job shops," Eur. J. Oper. Res., vol. 187, no. 1, pp. 31-45, 2008. (Pubitemid 350061089)
44. A. Jones, L. C. Rabelo, and A. T. Sharawi, "Survey of job shop scheduling techniques," in Wiley Encyclopedia of Electrical and Electronics Engineering. New York, NY, USA: Wiley, 2001.
45. M. R. Garey, D. S. Johnson, and R. Sethi, "The complexity of flowshop and jobshop scheduling," Math. Oper. Res., vol. 1, no. 2, pp. 117-129, 1976.
46. F. Glover, "Future paths for integer programming and links to artificial intelligence," Comput. Oper. Res., vol. 13, no. 5, pp. 533-549, 1986. (Pubitemid 17480188)
47. S. Luke. (2009). Essentials of Metaheuristics, Lulu [Online]. Available: http://cs.gmu.edu/~sean/book/metaheuristics/
48. E. Nowicki and C. Smutnicki, "A fast taboo search algorithm for the job shop problem," Manage. Sci., vol. 42, no. 6, pp. 797-813, 1996. (Pubitemid 126577322)
49. R. Cheng, M. Gen, and Y. Tsujimura, "A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: Hybrid genetic search strategies," Comput. Ind. Eng., vol. 36, no. 2, pp. 343-364, 1999.
50. J. F. Goncalves, J. J. de Magalhaes Mendes, and M. G. C. Resende, "A hybrid genetic algorithm for the job shop scheduling problem," Eur. J. Oper. Res., vol. 167, no. 1, pp. 77-95, 2005. (Pubitemid 40220004)
51. T. Yamada and R. Nakano, "A genetic algorithm with multi-step crossover for job-shop scheduling problems," in Proc. 1st Int. Conf. Genetic Algorithms Eng. Syst.: Innov. Appl., 1995, pp. 146-151.
52. D. Ouelhadj and S. Petrovic, "A survey of dynamic scheduling in manufacturing systems," J. Scheduling, vol. 12, no. 4, pp. 417-431, 2009.
53. C. N. Potts and V. A. Strusevich, "Fifty years of scheduling: A survey of milestones," J. Oper. Res. Soc., vol. 60, pp. S41-S68, May 2009.
54. K. N. McKay, F. R. Safayeni, and J. A. Buzacott, "Job-shop scheduling theory: What is relevant?" Interfaces, vol. 18, no. 4, pp. 84-90, 1988.
55. M. S. Jayamohan and C. Rajendran, "New dispatching rules for shop scheduling: A step forward," Int. J. Prod. Res., vol. 38, no. 3, pp. 563-586, 2000. (Pubitemid 35395465)
56. M. L. Pinedo, Scheduling: Theory, Algorithms, and Systems, 3rd ed. Berlin, Germany: Springer, 2008.
57. S. S. Panwalkar and W. Iskander, "A survey of scheduling rules," Oper. Res., vol. 25, no. 1, pp. 45-61, 1977.
58. C. Dimopoulos and A. M. S. Zalzala, "Investigating the use of genetic programming for a classic one-machine scheduling problem," Adv. Eng. Softw., vol. 32, no. 6, pp. 489-498, 2001. (Pubitemid 32421507)
59. C. D. Geiger, R. Uzsoy, and H. Aytug, "Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach," J. Heuristics, vol. 9, no. 1, pp. 7-34, 2006. (Pubitemid 43063747)
60. W. J. Yin, M. Liu, and C. Wu, "Learning single-machine scheduling heuristics subject to machine breakdowns with genetic programming," in Proc. IEEE Congr. Evol. Comput., Dec. 2003, pp. 1050-1055.
61. K. Miyashita, "Job-shop scheduling with GP," in Proc. Genetic Evol. Comput. Conf., 2000, pp. 505-512.
62. L. Atlan, J. Bonnet, and M. Naillon. (1994). "Learning distributed reactive strategies by genetic programming for the general job shop problem," in Proc. 7th Annu. Florida Artif. Intell. Res. Symp. [Online]. Available: http://www.cs.bham.ac.uk/~wbl/biblio/gphtml/ atlan 1994 gpjss.html
63. D. Jakobovic and L. Budin, "Dynamic scheduling with genetic programming," in Proc. 9th Eur. Conf. Genetic Program., 2006, pp. 73-84. (Pubitemid 44011469)
64. E. Zitzler, M. Laumanns, and L. Thiele, "SPEA2: Improving the strength Pareto evolutionary algorithm for multi-objective optimization," in Evolutionary Methods for Design, Optimisation and Control with Application to Industrial Problems. Barcelona, Spain: Int. Center Numerical Methods Eng., 2002, pp. 95-100.
65. Z. Wang, K. Tang, and X. Yao, "Multi-objective approaches to optimal testing resource allocation in modular software systems," IEEE Trans. Rel., vol. 59, no. 3, pp. 563-575, Sep. 2010.
66. C. K. Goh and K. C. Tan, "An investigation on noisy environments in evolutionary multi-objective optimization," IEEE Trans. Evol. Comput., vol. 11, no. 3, pp. 354-381, Jun. 2007. (Pubitemid 46895413)
67. C. K. Goh and K. C. Tan, "A competitive-cooperative coevolutionary paradigm for dynamic multi-objective optimization," IEEE Trans. Evol. Comput., vol. 13, no. 1, pp. 103-127, Feb. 2009.
68. K. C. Tan, Y. J. Yang, and C. K. Goh, "A distributed cooperative coevolutionary algorithm for multi-objective optimization," IEEE Trans. Evol. Comput., vol. 10, no. 5, pp. 527-549, Oct. 2006. (Pubitemid 44560741)
69. M. A. Potter and K. A. de Jong, "Cooperative coevolution: An architecture for evolving coadapted subcomponents," Evol. Comput., vol. 8, no. 1, pp. 1-29, 2000.
70. M. Thurer, M. Stevenson, C. Silva, M. Land, and M. G. Filho, "Workload control and order release in two-level multi-stage job shops: An assessment by simulation," Int. J. Prod. Res., vol. 51, no. 3, pp. 869-882, 2013.
71. M. Land, "Parameters and sensitivity in workload control," Int. J. Prod. Econ., vol. 104, no. 2, pp. 625-638, 2006. (Pubitemid 44403069)
72. A. P. J. Vepsalainen and T. E. Morton, "Priority rules for job shops with weighted tardiness costs," Manage. Sci., vol. 33, no. 8, pp. 1035-1047, 1987.
73. D. A. van Veldhuizen and G. B. Lamont, "Multi-objective evolutionary algorithm test suites," in Proc. ACM Symp. Appl. Comput., 1999, pp. 351-357.
74. E. S. Gee and C. H. Smith, "Selecting allowance policies for improved job shop performance," Int. J. Prod. Res., vol. 31, no. 8, pp. 1839-1852, 1993. (Pubitemid 23681151)
75. D. C. Montgomery, Design and Analysis of Experiments. New York NY, USA: Wiley, 2001.
76. R. F. Coelho and P. Bouillard, "Multi-objective reliability-based optimization with stochastic metamodels," Evol. Comput., vol. 19, no. 4, pp. 525-560, 2011.
77. K. Deb, S. Gupta, D. Daum, J. Branke, A. K. Mall, and D. Padmanabhan, "Reliability-based optimization using evolutionary algorithms," IEEE Trans. Evol. Comput., vol. 13, no. 5, pp. 1054-1074, Oct. 2009.
78. E. Hughes, "Evolutionary multi-objective ranking with uncertainty and noise," in Proc. 1st Int. Conf. Evol. Multi-Criterion Optim., 2001, pp. 329-343. (Pubitemid 33241397)
79. J. Teich, "Pareto-front exploration with uncertain objectives," in Proc. 1st Int. Conf. Evol. Multi-Criterion Optim., 2001, pp. 314-328. (Pubitemid 33241396)