Abstract
Order acceptance and scheduling (OAS) is an important issue in make-to-order production systems that decides the set of orders to accept and the sequence in which these accepted orders are processed to increase total revenue and improve customer satisfaction. This paper aims to explore the Pareto fronts of trade-off solutions for a multi-objective OAS problem. Due to its complexity, solving this problem is challenging. A two-stage learning/optimising (2SLO) system is proposed in this paper to solve the problem. The novelty of this system is the use of genetic programming to evolve a set of scheduling rules that can be reused to initialise populations of an evolutionary multi-objective optimisation (EMO) method. The computational results show that 2SLO is more effective than the pure EMO method. Regarding maximising the total revenue, 2SLO is also competitive as compared to other optimisation methods in the literature.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Allahverdi, A., Gupta, J.N., Aldowaisan, T.: A review of scheduling research involving setup considerations. Omega 27(2), 219–239 (1999)
Bilge, U., Kurtulan, M., Kirac, F.: A tabu search algorithm for the single machine total weighted tardiness problem. European Journal of Operational Research 176(3), 1423–1435 (2007)
Boejko, W., Grabowski, J., Wodecki, M.: Block approach-tabu search algorithm for single machine total weighted tardiness problem. Computers & Industrial Engineering 50(1-2), 1–14 (2006)
Cesaret, B., Oguz, C., Salman, F.S.: A tabu search algorithm for order acceptance and scheduling. Computers & Operations Research 39(6), 1197–1205 (2012)
Cheng, T.C.E., Jiang, J.: Job shop scheduling for missed due-date performance. Computers & Industrial Engineering 34, 297–307 (1998)
Cheng, T.C.E., Podolsky, S.: Just-in-Time Manufacturing: An Introduction. Chapman and Hall, London (1993)
Choobineh, F.F., Mohebbi, E., Khoo, H.: A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times. European Journal of Operational Research 175(1), 318–337 (2006)
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6(2), 182–197 (2002)
Geiger, C.D., Uzsoy, R., Aytug, H.: Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach. Journal of Heuristics 9(1), 7–34 (2006)
Ghosh, J.B.: Job selection in a heavily loaded shop. Computers & Operations Research 24(2), 141–145 (1997)
Hildebrandt, T., Heger, J., Scholz-Reiter, B.: Towards improved dispatching rules for complex shop floor scenarios: a genetic programming approach. In: GECCO 2010: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, pp. 257–264 (2010)
Hino, C.M., Ronconi, D.P., Mendes, A.B.: Minimizing earliness and tardiness penalties in a single-machine problem with a common due date. European Journal of Operational Research 160(1), 190–201 (2005)
Jakobović, D., Jelenković, L., Budin, L.: Genetic Programming Heuristics for Multiple Machine Scheduling. In: Ebner, M., O’Neill, M., Ekárt, A., Vanneschi, L., Esparcia-Alcázar, A.I. (eds.) EuroGP 2007. LNCS, vol. 4445, pp. 321–330. Springer, Heidelberg (2007)
Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press (1992)
Lee, Y.H., Bhaskaran, K., Pinedo, M.: A heuristic to minimize the total weighted tardiness with sequence-dependent setups. IIE Transactions 29(1), 45–52 (1997)
Nguyen, S., Zhang, M., Johnston, M., Tan, K.C.: A coevolution genetic programming method to evolve scheduling policies for dynamic multi-objective job shop scheduling problems. In: CEC 2012: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 3261–3268 (2012)
Nguyen, S., Zhang, M., Johnston, M., Tan, K.C.: Evolving Reusable Operation-Based Due-Date Assignment Models for Job Shop Scheduling with Genetic Programming. In: Moraglio, A., Silva, S., Krawiec, K., Machado, P., Cotta, C. (eds.) EuroGP 2012. LNCS, vol. 7244, pp. 121–133. Springer, Heidelberg (2012)
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)
Rom, W.O., Slotnick, S.A.: Order acceptance using genetic algorithms. Computers & Operations Research 36(6), 1758–1767 (2009)
Roundy, R., Chen, D., Chen, P., Cakanyildirim, M., Freimer, M.B., Melkonian, V.: Capacity-driven acceptance of customer orders for a multi-stage batch manufacturing system: models and algorithms. IIE Transactions 37(12), 1093–1105 (2005)
Selim Akturk, M., Ozdemir, D.: An exact approach to minimizing total weighted tardiness with release dates. IIE Transactions 32(11), 1091–1101 (2000)
Slotnick, S.A., Morton, T.E.: Selecting jobs for a heavily loaded shop with lateness penalties. Computers & Operations Research 23(2), 131–140 (1996)
Slotnick, S.A., Morton, T.E.: Order acceptance with weighted tardiness. Computers & Operations Research 34(10), 3029–3042 (2007)
Tay, J.C., Ho, N.B.: Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems. Computer & Industrial Engineering 54, 453–473 (2008)
Van Veldhuizen, D.A., Lamont, G.B.: Multiobjective evolutionary algorithm test suites. In: SAC 1999: Proceedings of the 1999 ACM Symposium on Applied Computing, pp. 351–357 (1999)
Wester, F.A.W., Wijngaard, J., Zijm, W.R.M.: Order acceptance strategies in a production-to-order environment with setup times and due-dates. International Journal of Production Research 30(6), 1313–1326 (1992)
Yang, W.H.: Survey of scheduling research involving setup times. International Journal of Systems Science 30(2), 143–155 (1999)
Zhang, J., Zhan, Z.H., Lin, Y., Chen, N., Gong, Y.J., Zhong, J.H., Chung, H., Li, Y., Shi, Y.H.: Evolutionary computation meets machine learning: A survey. IEEE Computational Intelligence Magazine 6(4), 68–75 (2011)
Zitzler, E., Laumanns, M., Thiele, L.: 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, pp. 95–100 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nguyen, S., Zhang, M., Johnston, M., Tan, K.C. (2013). 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) Genetic Programming. EuroGP 2013. Lecture Notes in Computer Science, vol 7831. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37207-0_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-37207-0_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37206-3
Online ISBN: 978-3-642-37207-0
eBook Packages: Computer ScienceComputer Science (R0)