Genetic Programming for Evolving Due-Date Assignment Models in Job Shop Environments

Evolutionary Computation

Volumn 22, Issue 1, 2014, Pages 105-138

  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

Due date assignment; Genetic programming; Hyper heuristics; Job shop

Indexed keywords

BETTER PERFORMANCE; DELIVERY PERFORMANCE; DUE-DATE ASSIGNMENT; DYNAMIC NATURE; HYPER-HEURISTICS; JOB SHOP; JOB SHOP ENVIRONMENT; SCHEDULING SYSTEMS;

REUSABILITY; STOCHASTIC MODELS;

GENETIC PROGRAMMING;

ALGORITHM; ARTICLE; COMPUTER ANALYSIS; COMPUTER LANGUAGE; PERSONNEL MANAGEMENT; THEORETICAL MODEL;

ALGORITHMS; COMPUTING METHODOLOGIES; MODELS, THEORETICAL; PERSONNEL STAFFING AND SCHEDULING; PROGRAMMING LANGUAGES;

EID: 84893594802     PISSN: 10636560     EISSN: 15309304     Source Type: Journal    
DOI: 10.1162/EVCO_a_00105     Document Type: Letter

References (48)

1. Ahmed, I., and Fisher, W. W. (1992). Due date assignment, job order release, and sequencing interaction in job shop scheduling. Decision Sciences, 23(3):633-647.
2. Bader-El-Den, M. B., Poli, R., and Fatima, S. (2009). Evolving timetabling heuristics using a grammar-based genetic programming hyper-heuristic framework. Memetic Computing, 1(3):205-219.
3. Banzhaf, W., Nordin, P., Keller, R., and Francone, F. (1998). Genetic programming: An introduction. San Mateo, CA: Morgan Kaufmann.
4. Baykasoglu, A., and Gocken, M.(2009). Gene expression programming basedduedate assignment in a simulated job shop. Expert Systems with Applications, 36(10):12143-12150.
5. Baykasoglu, A., and Gocken, M. (2011). A simulation based approach to analyse the effects of job release on the performance of a multi-stage job-shop with processing flexibility. International Journal of Production Research, 49(2):585-610.
6. Baykasoglu, A., Gocken, M., and Unutmaz, Z. D. (2008). New approaches to due date assignment in job shops. European Journal of Operational Research, 187(1):31-45.
7. Bookbinder, J. H., and Noor, A. I. (1985). Setting job-shop due-dates with service-level constraints. Journal of the Operational Research Society, 36(11):1017-1026.
8. Burke, E., Hyde, M., Kendall, G., and Woodward, J. (2010a). A genetic programming hyper-heuristic approachfor evolving 2-D strip packingheuristics. IEEE TransactionsonEvolutionary Computation, 14(6):942-958.
9. Burke, E. K., Hyde, M., Kendall, G., Ochoa, G., Ozcan, E., and Qu, R. (2010b). Hyper-heuristics: A survey of the state of the art. School of Computer Science and Information Technology, University of Nottingham. (Computer Science Technical Report No. NOTTCS-TR-SUB-0906241418-2747).
10. Burke, E.K., Hyde, M. R., Kendall, G., Ochoa, G., Ozcan, E., and Woodward, J. R. (2009). Exploring hyper-heuristic methodologies with genetic programming. In C. L. Munford and L. C. Jain (Eds.), Computational intelligence: Collaboration, fusion and emergence (pp. 177-201). Berlin: Springer-Verlag.
11. Burke, E. K., Hyde, M. R., Kendall, G., and Woodward, J. (2007a). Automatic heuristic generation with genetic programming: Evolving a jack-of-all-trades or a master of one. In Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, GECCO'07, pp. 1559- 1565.
12. Burke, E. K., Hyde, M. R., Kendall, G., and Woodward, J. (2007b). The scalability of evolved online bin packing heuristics. In Proceedings of the IEEE Congress on Evolutionary Computation, CEC'07, pp. 2530-2537.
13. Burke, E. K., Hyde, M. R., Kendall, G., and Woodward, J.(2011). Automating the packing heuristic design process with genetic programming. Evolutionary Computation, 20(1):63-89.
14. Chang, F.-C. R. (1996). A study of due-date assignment rules with constrained tightness in a dynamic job shop. Computers and Industrial Engineering, 31(1-2):205-208.
15. Cheng, T. C. E., and Gupta, M. C. (1989). Survey of scheduling research involving due date determination decisions. European Journal of Operational Research, 38(2):156-166.
16. Cheng, T. C. E., and Jiang, J. (1998). Job shop scheduling for missed due-date performance. Computers and Industrial Engineering, 34(2):297-307.
17. Cheng, T. C. E., and Podolsky, S. (1993). Just-in-time manufacturing: An introduction. London: Chapman and Hall.
18. Fry, T. D., Philipoom, P. R., and Markland, R. E. (1989). Due date assignment in a multistage job shop. IIE Transactions, 21(2):153-161.
19. Fukunaga, A. (2002). Automated discovery of composite SAT variable-selection heuristics. In Proceedings of the Eighteenth National Conference on Artificial Intelligence, pp. 641-648.
20. Fukunaga, A. (2008). Automated discovery of local search heuristics for satisfiability testing. Evolutionary Computation, 16(1):21-61.
21. Geiger, C. D., Uzsoy, R., and Aytug, H. (2006). Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach. Journal of Heuristics, 9(1):7-34.
22. Hildebrandt, T., Heger, J., and Scholz-Reiter, B. (2010). Towards improved dispatching rules for complex shop floor scenarios: A genetic programming approach. In Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, GECCO'10, pp. 257-264.
23. Hino, C. M., Ronconi, D. P., and Mendes, A. B. (2005). Minimizing earliness and tardiness penalties in a single-machine problem with a common due date. European Journal of Operational Research, 160(1):190-201.
24. Jakobovic, D., and Budin, L. (2006). Dynamic scheduling with genetic programming. In Proceedings of the 9th European Conference on Genetic Programming, EuroGP'06, pp. 73-84.
25. Jakobovic, D., Jelenkovic, L., and Budin, L. (2007). Genetic programming heuristics for multiple machine scheduling. In Proceedings of the 10th European Conference on Genetic Programming, EuroGP'07, pp. 321-330.
26. Joseph, O., and Sridharan, R. (2011). Analysis of dynamic due-date assignment models in a flexible manufacturing system. Journal of Manufacturing Systems, 30(1):28-40.
27. Keller, R., and Poli, R. (2007a). Cost-benefit investigation of a genetic-programming hyperheuris-tic. In Proceedings of the 8th International Conference on Artificial Evolution, pp. 13-24.
28. Keller, R., and Poli, R. (2007b). Linear genetic programming of parsimonious metaheuristics. In Proceedings of the IEEE Congress on Evolutionary Computation, CEC'07, pp. 4508-4515.
29. Koza, J. R. (1992). Genetic programming: On the programming of computers by means of natural selection. Cambridge, MA: MIT Press.
30. Land, M. J. (2004). Workload control in job shops, grasping the tap. Ph.D. thesis, University of Gronin-gen, The Netherlands.
31. Little, J. D. C. (1961). A proof for the queuing formula: L = λW. Operations Research, 9(3):383-387.
32. Luke, S. (2009). Essentials of metaheuristics. Raleigh, NC: Lulu Press. Available for free at http://cs.gmu.edu/sean/book/metaheuristics
33. Nguyen, S., Zhang, M., Johnston, M., and Tan, K. C. (2012). Evolving reusable operation-based due-date assignment models for job shop scheduling with genetic programming. In Proceedings of the 15th European Conference on Genetic Programming, EuroGP'12, pp. 121-133.
34. Ozturk, A., Kayaligil, S., and Ozdemirel, N. E. (2006). Manufacturing lead time estimation using data mining. European Journal of Operational Research, 173(2):683-700.
35. Panwalkar, S. S., and Iskander, W. (1977). A survey of scheduling rules. Operations Research, 25(1):45-61.
36. Patil, R. J. (2008). Using ensemble and metaheuristics learning principles with artificial neural networks to improve due date prediction performance. International Journal of Production Research, 46(21):6009-6027.
37. Philipoom, P. R., Rees, L. P., and Wiegmann, L. (1994). Using neural networks to determine internally-set due-date assignments for shop scheduling. Decision Sciences, 25(5-6):825-851.
38. Pinedo, M. L. (2008). Scheduling: Theory, algorithms, and systems, 3rd ed. Berlin: Springer.
39. Ragatz, G.L., and Mabert, V. A. (1984). A simulation analysis ofdue date assignment rules. Journal of Operations Management, 5(1):27-39.
40. Ramasesh, R. (1990). Dynamic job shop scheduling: A survey of simulation research. Omega, 18(1):43-57.
41. Sabuncuoglu, I., and Comlekci, A. (2002). Operation-based flowtime estimation in a dynamic job shop. Omega, 30(6):423-442.
42. Sha, D., and Hsu, S. (2004). Due-date assignment in wafer fabrication using artificial neural networks. The International Journal of Advanced Manufacturing Technology, 23(9-10):768-775.
43. Sha, D., and Liu, C.-H. (2005). Using data mining for due date assignment in a dynamic job shop environment. The International Journal of Advanced Manufacturing Technology, 25(11-12):1164-1174.
44. Sha, D. Y., Storch, R. L., and Liu, C. H. (2007). Development of a regression-based method with case-based tuning to solve the due date assignment problem. International Journal of Production Research, 45(1):65-82.
45. Tay, J. C., and Ho, N. B. (2008). Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems. Computers and Industrial Engineering, 54(3):453-473.
46. Veral, E.A.(2001). Computersimulation ofdue-datesetting in multi-machine jobshops. Computers and Industrial Engineering, 41(1):77-94.
47. Vig, M. M., and Dooley, K. J. (1993). Mixing static and dynamic flowtime estimates for due-date assignment. Journal of Operations Management, 11(1):67-79.
48. Vinod, V., and Sridharan, R. (2011). Simulation modeling and analysis of due-date assignment methods and scheduling decision rules in a dynamic job shop production system. International Journal of Production Economics, 129(1):127-146.