Genetic programming for order acceptance and scheduling

2013 IEEE Congress on Evolutionary Computation, CEC 2013

Volumn , Issue , 2013, Pages 1005-1012

  Park, John ^a   Nguyen, Su ^a   Zhang, Mengjie ^a   Johnston, Mark ^a  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

Author keywords

Beam Search; Genetic Programming; Iterative Dispatching Rules; Order Acceptance and Scheduling

Indexed keywords

BEAM SEARCH; DISPATCHING RULES; HEURISTIC SEARCH; META HEURISTICS; ORDER ACCEPTANCE; OVERFITTING; QUALITY OF SCHEDULING; SCHEDULING RULES;

DATA STORAGE EQUIPMENT; GENETIC PROGRAMMING; HEURISTIC ALGORITHMS;

SCHEDULING;

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

References (32)

1. M. L. Pinedo, Scheduling: Theory, Algorithms, and Systems, 3rd ed. Springer Publishing Company, Incorporated, 2008.
2. R. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, ser. Series of Books in the Mathematical Sciences. W. H. Freeman, 1979.
3. E. Aarts and J. K. Lenstra, Eds., Local Search in Combinatorial Optimization, 1st ed. New York: John Wiley & Sons, 1997.
4. A. Jones and L. C. Rabelo, "Survey of job shop scheduling techniques," 1998.
5. E. K. Burke, M. R. Hyde, G. Kendall, G. Ochoa, E. Ozcan, and R. Qu, "Hyper-heuristics: A survey of the state of the art," no. Computer Science Technical Report No. NOTTCS-TR-SUB-0906241418-2747, 2010.
6. E. Burke, M. Hyde, G. Kendall, G. Ochoa, E. Ozcan, and J. Woodward, "Exploring hyper-heuristic methodologies with genetic programming," in Computational Intelligence, ser. Intelligent Systems Reference Library, C. Mumford and L. Jain, Eds. Springer, Heidelberg, 2009, vol. 1, pp. 177-201.
7. S. Nguyen, M. Zhang, M. Johnston, and K. C. Tan, "A computational study of representations in genetic programming to evolve dispatching rules for the job shop scheduling problem," IEEE Transactions on Evolutionary Computation, 2012, DOI:10.1109/TEVC.2012.2227326.
8. C. D. Geiger, R. Uzsoy, and H. Aytug, "Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach," Journal of Scheduling, vol. 9, no. 1, pp. 7-34, 2006.
9. S. Nguyen, M. Zhang, M. Johnston, and K. C. Tan, "Learning reusable initial solutions for multi-objective order acceptance and scheduling problems with genetic programming," in EuroGP'13: Proceedings of European Conference on Genetic Programming. Springer, Heidelberg, 2013, pp. 157-168.
10. C. Dimopoulos and A. 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.
11. D. Jakobovíc and L. Budin, "Dynamic scheduling with genetic programming," in Proceedings of the 9th European Conference on Genetic Programming, 2006, pp. 73-84.
12. B. Cesaret, C. O?guz, and F. Sibel Salman, "A tabu search algorithm for order acceptance and scheduling," Computers & Operations Research, vol. 39, no. 6, pp. 1197-1205, 2012.
13. J. B. Ghosh, "Job selection in a heavily loaded shop," Computers & Operations Research, vol. 24, no. 2, pp. 141-145, 1997.
14. S. A. Slotnick and T. E. Morton, "Order acceptance with weighted tardiness," Computers & Operations Research, vol. 34, no. 10, pp. 3029-3042, 2007.
15. N. Reinfeld and W. Vogel, Mathematical programming. Prentice-Hall, 1958.
16. W. O. Rom and S. A. Slotnick, "Order acceptance using genetic algorithms," Computers & Operations Research, vol. 36, no. 6, pp. 1758-1767, 2009.
17. S. Huang, M. Lu, and G. Wan, "Integrated order selection and production scheduling under mto strategy," International Journal of Production Research, vol. 49, no. 13, pp. 4085-4101, 2011.
18. C. O?guz, F. S. Salman, and Z. B. Yaln, "Order acceptance and scheduling decisions in make-to-order systems," International Journal of Production Economics, vol. 125, no. 1, pp. 200-211, 2010.
19. Y. H. Lee, K. Bhaskaran, and M. Pinedo, "A heuristic to minimize the total weighted tardiness with sequence-dependent setups," IIE Transactions, vol. 29, no. 1, pp. 45-52, 1997.
20. S. A. Slotnick, "Order acceptance and scheduling: A taxonomy and review," European Journal of Operational Research, vol. 212, no. 1, pp. 1-11, 2011.
21. X. Wang, X. Xie, and T. Cheng, "A modified artificial bee colony algorithm for order acceptance in two-machine flow shops," International Journal of Production Economics, vol. 141, no. 1, pp. 14-23, 2013.
22. S. Mestry, P. Damodaran, and C.-S. Chen, "A branch and price solution approach for order acceptance and capacity planning in make-to-order operations," European Journal of Operational Research, vol. 211, no. 3, pp. 480-495, 2011.
23. F. A. W. Wester, J. Wijngaard, and W. R. M. Zijm, "Order acceptance strategies in a production-to-order environment with setup times and due-dates," International Journal of Production Research, vol. 30, no. 6, pp. 1313-1326, 1992.
24. R. Roundy, D. Chen, P. Chen, M. Cakanyildirim, M. B. Freimer, and V. Melkonian, "Capacity-driven acceptance of customer orders for a multi-stage batch manufacturing system: models and algorithms," IIE Transactions, vol. 37, no. 12, pp. 1093-1105, 2005.
25. J. R. Koza, Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, 1992.
26. E. Montagne, An Investigation of Sequencing with Time Delay Costs. Arizona State University-Industrial Engineering, 1968.
27. C. D. Geiger and R. Uzsoy, "Learning effective dispatching rules for batch processor scheduling," International Journal of Production Research, vol. 46, no. 6, pp. 1431-1454, 2008.
28. W.-J. Yin, M. Liu, and C. Wu, "Learning single-machine scheduling heuristics subject to machine breakdowns with genetic programming," in CEC '03: Proceedings of the IEEE Congress on Evolutionary Computation, vol. 2, dec. 2003, pp. 1050-1055 Vol.2.
29. S. Nguyen, M. Zhang, M. Johnston, and K. C. Tan, "Learning iterative dispatching rules for job shop scheduling with genetic programming," The International Journal of Advanced Manufacturing Technology, 2013, DOI:10.1007/s00170-013-4756-9.
30. P. Norvig, Paradigms of Artificial Intelligence Programming: Case Studies in Common Lisp, ser. Morgan Kaufmann. Morgan Kaufman Publishers, 1992.
31. S. Luke. (2010) ECJ package. [Online]. Available: http://cs.gmu.edu/\? eclab/projects/ecj/
32. B. Cesaret, C. O?guz, and F. Sibel Salman. (2012) Dataset oas. [Online]. Available: http://home.ku.edu.tr/?coguz/Research/Dataset OAS.zip