A coevolution genetic programming method to evolve scheduling policies for dynamic multi-objective job shop scheduling problems

2012 IEEE Congress on Evolutionary Computation, CEC 2012

Volumn , Issue , 2012, Pages

  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

[No Author keywords available]

Indexed keywords

AUTOMATIC DESIGN; CO-EVOLUTION; COOPERATIVE CO-EVOLUTION; DISPATCHING RULES; DUE-DATE ASSIGNMENT; HYPERHEURISTIC; JOB SHOP ENVIRONMENT; JOB SHOP SCHEDULING PROBLEMS; MULTI OBJECTIVE; NSGA-II; PARETO FRONT; SCHEDULING DECISIONS; SCHEDULING POLICIES;

HEURISTIC METHODS;

GENETIC PROGRAMMING;

EID: 84866872268     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2012.6252968     Document Type: Conference Paper

References (35)

1. I. Ahmed and W. W. Fisher, "Due date assignment, job order release, and sequencing interaction in job shop scheduling," Decision Sciences, vol. 23, no. 3, pp. 633-647, 1992.
2. J. R. Koza, Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, 1992.
3. 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, University of Nottingham, Tech. Rep. Computer Science Technical Report No. NOTTCS-TR-SUB-0906241418-2747, 2010.
4. E. K. Burke, M. Hyde, G. Kendall, G. Ochoa, E. Ozcan, and J. R. Woodward, "Exploring hyper-heuristic methodologies with genetic programming," Artificial Evolution, vol. 1, pp. 177-201, 2009.
5. R. Ramasesh, "Dynamic job shop scheduling: A survey of simulation research," Omega, vol. 18, no. 1, pp. 43-57, 1990.
6. T. C. E. Cheng and J. Jiang, "Job shop scheduling for missed due-date performance," Computers & Industrial Engineering, vol. 34, pp. 297-307, 1998.
7. I. Sabuncuoglu and A. Comlekci, "Operation-based flowtime estimation in a dynamic job shop," Omega, vol. 30, no. 6, pp. 423-442, 2002.
8. O. Joseph and R. Sridharan, "Analysis of dynamic due-date assignment models in a flexible manufacturing system," Journal of Manufacturing Systems, vol. 30, no. 1, pp. 28-40, 2011.
9. D. Sha and S. Hsu, "Due-date assignment in wafer fabrication using artificial neural networks," The International Journal of Advanced Manufacturing Technology, vol. 23, pp. 768-775, 2004.
10. A. Ozturk, S. Kayaligil, and N. E. Ozdemirel, "Manufacturing lead time estimation using data mining," European Journal of Operational Research, vol. 173, no. 2, pp. 683-700, 2006.
11. D. Sha and C.-H. Liu, "Using data mining for due date assignment in a dynamic job shop environment," The International Journal of Advanced Manufacturing Technology, vol. 25, pp. 1164-1174, 2005.
12. D. Y. Sha, R. L. Storch, and C. H. Liu, "Development of a regression-based method with case-based tuning to solve the due date assignment problem," International Journal of Production Research, vol. 45, no. 1, pp. 65-82, 2007.
13. A. Baykasoglu, M. Gocken, and Z. D. Unutmaz, "New approaches to due date assignment in job shops," European Journal of Operational Research, vol. 187, pp. 31-45, 2008.
14. A. Jones and L. C. Rabelo, "Survey of job shop scheduling techniques," NISTIR, National Institute of Standards and Technology, Gaithersburg, USA, Tech. Rep., 1998.
15. M. S. Jayamohan and C. Rajendran, "New dispatching rules for shop scheduling: a step forward," International Journal of Production Research, vol. 38, pp. 563-586, 2000.
16. S. S. Panwalkar and W. Iskander, "A survey of scheduling rules," Operations Research, vol. 25, pp. 45-61, 1977.
17. G. L. Ragatz and V. A. Mabert, "A simulation analysis of due date assignment rules," Journal of Operations Management, vol. 5, no. 1, pp. 27-39, 1984.
18. K. R. Baker, "Sequencing rules and due-date assignments in a job shop," Management Science, vol. 30, pp. 1093-1104, 1984.
19. S. Miyazaki, "Combined scheduling system for reducing job tardiness in a job shop," International Journal of Production Research, vol. 19, no. 2, pp. 201-211, 1981.
20. T. C. E. Cheng, "Integration of priority dispatching and due-date assignment in a job shop," International Journal of Systems Science, vol. 19, no. 9, pp. 1813-1825, 1988.
21. C. Dimopoulos and A. M. S. Zalzala, "Investigating the use of genetic programming for a classic one-machine scheduling problem," Advances in Engineering Software, vol. 32, no. 6, pp. 489-498, 2001.
22. C. D. Geiger, R. Uzsoy, and H. Aytug, "Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach," Journal of Heuristics, vol. 9, no. 1, pp. 7-34, 2006.
23. D. Jakobovic and L. Budin, "Dynamic scheduling with genetic programming," in EuroGP'06: Proceedings of the 9th European Conference on Genetic Programming, 2006, pp. 73-84.
24. J. C. Tay and N. B. Ho, "Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems," Computers & Industrial Engineering, vol. 54, pp. 453-473, 2008.
25. T. Hildebrandt, J. Heger, and B. Scholz-Reiter, "Towards improved dispatching rules for complex shop floor scenarios: a genetic programming approach," in GECCO '10: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, 2010, pp. 257-264.
26. J. A. Vazquez-Rodriguez and G. Ochoa, "On the automatic discovery of variants of the neh procedure for flow shop scheduling using genetic programming," Journal of the Operational Research Society, vol. 62, pp. 381-396, 2011.
27. M. L. Pinedo, Scheduling: Theory, Algorithms, and Systems, 3rd ed. Springer, 2008.
28. K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, "A fast and elitist multiobjective genetic algorithm: NSGA-II," IEEE Transactions on Evolutionary Computation, vol. 6, no. 2, pp. 182-197, 2002.
29. E. Zitzler, M. Laumanns, and L. Thiele, "SPEA2: Improving the strength pareto evolutionary algorithm for multiobjective optimization," in Evolutionary Methods for Design, Optimisation and Control with Application to Industrial Problems (EUROGEN 2001), 2002.
30. M. Pinedo and M. Singer, "A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop," Naval Research Logistics, vol. 46, no. 1, pp. 1-17, 1999.
31. A. P. J. Vepsalainen and T. E. Morton, "Priority rules for job shops with weighted tardiness costs," Management Science, vol. 33, pp. 1035-1047, 1987.
32. E. S. Gee and C. H. Smith, "Selecting allowance policies for improved job shop performance," International Journal of Production Research, vol. 31, no. 8, pp. 1839-1852, 1993.
33. E. Zitzler and L. Thiele, "Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach," IEEE Transactions on Evolutionary Computation, vol. 3, no. 4, pp. 257-271, 1999.
34. D. A. Van Veldhuizen and G. B. Lamont, "Multiobjective evolutionary algorithm test suites," in Proceedings of the 1999 ACM symposium on Applied computing (SAC'99), 1999, pp. 351-357.
35. D. A.Van Veldhuizen and G. B. Lamont, "Multiobjective evolutionary algorithm research: a history and analysis," Department of Electrical and Computer Engineering, Air Force Institute of Technology, Ohio, Technical Report TR-98-03, 1998.