A sequential genetic programming method to learn forward construction heuristics for order acceptance and scheduling

Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014

Volumn , Issue , 2014, Pages 1824-1831

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

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

Author keywords

genetic programming; heuristics; scheduling

Indexed keywords

DATA STORAGE EQUIPMENT; GENETIC ALGORITHMS; GENETIC PROGRAMMING; HEURISTIC PROGRAMMING; SCHEDULING;

AUTOMATIC DESIGN; CONSTRUCTION HEURISTICS; EFFECTIVE SOLUTION; HEURISTICS; OPTIMAL SCHEDULING; OPTIMISATION PROBLEMS; ORDER ACCEPTANCE; SCHEDULING DECISIONS;

HEURISTIC METHODS;

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

References (17)

1. B. Cesaret, C. Oguz, and F. S. Salman, "A tabu search algorithm for order acceptance and scheduling," Computers &Operations Research, vol. 39, no. 6, pp. 1197-1205, 2012.
2. 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 Proceedings of the 16th European Conference on Genetic Programming, 2013, pp. 157-168.
3. S. W. Lin and K. C. Ying, "Increasing the total net revenue for single machine order acceptance and scheduling problems using an artificial bee colony algorithm," Journal of the Operational Research Society, vol. 64, pp. 293-311, 2013.
4. C. Oguz, F. Sibel Salman, and Z. Bilginturk Yalcin, "Order acceptance and scheduling decisions in make-to-order systems," International Journal of Production Economics, vol. 125, no. 1, pp. 200-211, 2010.
5. J. B. Ghosh, "Job selection in a heavily loaded shop," Computers &Operations Research, vol. 24, no. 2, pp. 141-145, 1997.
6. S. A. Slotnick and T. E. Morton, "Selecting jobs for a heavily loaded shop with lateness penalties," Computers &Operations Research, vol. 23, no. 2, pp. 131-140, 1996.
7. -, "Order acceptance with weighted tardiness," Computers &Operations Research, vol. 34, no. 10, pp. 3029-3042, 2007.
8. W. O. Rom and S. A. Slotnick, "Order acceptance using genetic algorithms," Computers &Operations Research, vol. 36, no. 6, pp. 1758-1767, 2009.
9. 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.
10. J. R. Koza, Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, 1992.
11. 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.
12. D. Jakobovic, L. Jelenkovic, and L. Budin, "Genetic programming heuristics for multiple machine scheduling," in EuroGP'07: Proceedings of the 10th European Conference on Genetic programming, 2007, pp. 321-330.
13. C. W. Pickardt, T. Hildebrandt, J. Branke, J. Heger, and B. Scholz-Reiter, "Evolutionary generation of dispatching rule sets for complex dynamic scheduling problems," International Journal of Production Economics, 2012, in Press. [Online]. Available: Http://www.sciencedirect.com/ science/article/pii/S0925527312004574
14. J. Park, S. Nguyen, M. Zhang, and M. Johnston, "Genetic programming for order acceptance and scheduling," in Proceedings of the IEEE Congress on Evolutionary Computation, 2013, pp. 3261-3268.
15. S. A. Slotnick, "Order acceptance and scheduling: A taxonomy and review," European Journal of Operational Research, vol. 212, no. 1, pp. 1-11, 2011.
16. M. L. Pinedo, Scheduling: Theory, Algorithms, and Systems. Springer, 2008.
17. S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations. New York: John Wiley &Sons, Inc., 1990.