Enhancing Branch-and-Bound Algorithms for Order Acceptance and Scheduling with Genetic Programming

  • Su Nguyen
  • Mengjie Zhang
  • Mark Johnston
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8599)

Abstract

Order acceptance and scheduling (OAS) is an important planning activity in make-to-order manufacturing systems. Making good acceptance and scheduling decisions allows the systems to utilise their manufacturing resources better and achieve higher total profit. Therefore, finding optimal solutions for OAS is desirable. Unfortunately, the exact optimisation approaches previously proposed for OAS are still very time consuming and usually fail to solve the problem even for small instances in a reasonable computational time. In this paper, we develop a new branch-and-bound (B&B) approach to finding optimal solutions for OAS. In order to design effective branching strategies for B&B, a new GP method has been proposed to discover good ordering rules. The results show that the B&B algorithms enhanced by GP can solve the OAS problem more effectively than the basic B&B algorithm and the CPLEX solver on the Mixed Integer Linear Programming model.

Keywords

genetic programming scheduling branch-and-bound 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Cesaret, B., Oguz, C., Salman, F.S.: A tabu search algorithm for order acceptance and scheduling. Computers & Operations Research 39(6), 1197–1205 (2012)CrossRefGoogle Scholar
  2. 2.
    Ghosh, J.B.: Job selection in a heavily loaded shop. Computers & Operations Research 24(2), 141–145 (1997)CrossRefMATHGoogle Scholar
  3. 3.
    Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press (1992)Google Scholar
  4. 4.
    Lin, S.W., Ying, K.C.: 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 64, 293–311 (2013)CrossRefGoogle Scholar
  5. 5.
    Luke, S.: Essentials of Metaheuristics. Lulu (2009)Google Scholar
  6. 6.
    Martello, S., Toth, P.: Knapsack problems: algorithms and computer implementations. John Wiley & Sons, Inc., New York (1990)MATHGoogle Scholar
  7. 7.
    Nguyen, S., Zhang, M., Johnston, M., Tan, K.C.: Learning reusable initial solutions for multi-objective order acceptance and scheduling problems with genetic programming. In: Krawiec, K., Moraglio, A., Hu, T., Etaner-Uyar, A.Ş., Hu, B. (eds.) EuroGP 2013. LNCS, vol. 7831, pp. 157–168. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  8. 8.
    Oguz, C., Sibel Salman, F., Bilginturk Yalcin, Z.: Order acceptance and scheduling decisions in make-to-order systems. International Journal of Production Economics 125(1), 200–211 (2010)CrossRefGoogle Scholar
  9. 9.
    Park, J., Nguyen, S., Zhang, M., Johnston, M.: Genetic programming for order acceptance and scheduling. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 3261–3268 (2013)Google Scholar
  10. 10.
    Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems. Springer (2008)Google Scholar
  11. 11.
    Rom, W.O., Slotnick, S.A.: Order acceptance using genetic algorithms. Computers & Operations Research 36(6), 1758–1767 (2009)CrossRefMATHGoogle Scholar
  12. 12.
    Slotnick, S.A., Morton, T.E.: Selecting jobs for a heavily loaded shop with lateness penalties. Computers & Operations Research 23(2), 131–140 (1996)CrossRefMATHGoogle Scholar
  13. 13.
    Slotnick, S.A., Morton, T.E.: Order acceptance with weighted tardiness. Computers & Operations Research 34(10), 3029–3042 (2007)CrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Su Nguyen
    • 1
  • Mengjie Zhang
    • 1
  • Mark Johnston
    • 1
  1. 1.Evolutionary Computation Research GroupVictoria University of WellingtonWellingtonNew Zealand

Personalised recommendations