Abstract
Customer Order Scheduling Problem (COSP) is an NP-Hard problem that has important practical applications e.g., in the paper industry and the pharmaceutical industry. The existing algorithms to solve COSP still either find low quality solutions or scramble with large-sized problems. In this paper, we propose a new constructive heuristic called repair-based mechanism (RBM) that outperforms the best-known heuristics in the literature. We also propose a mixed neighbourhood local search (MNLS) algorithm. MNLS embeds a number of move operators to diversify the local exploitation making different areas around the current solution accessible. Moreover, we also propose a greedy diversification method to keep the search focussed even when it is in a plateau. Our experimental results on 960 well-known problem instances indicate statistically significant improvement obtained by the proposed MNLS over existing state-of-the-art algorithms. MNLS has found new best solutions for 721 out of the 960 problem instances.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Ahmadi, R., Bagchi, U., Roemer, T.A.: Coordinated scheduling of customer orders for quick response. Naval Res. Logist. (NRL) 52(6), 493–512 (2005)
Ahmadi, R., Bagchi, U.: Scheduling of Multi-job Customer Orders in Multi-machine Environments. ORSA/TIMS, Philadelphia (1990)
Framinan, J.M., Perez-Gonzalez, P.: New approximate algorithms for the customer order scheduling problem with total completion time objective. Comput. Oper. Res. 78, 181–192 (2017)
Lee, I.S.: Minimizing total tardiness for the order scheduling problem. Int. J. Prod. Econ. 144(1), 128–134 (2013)
Leung, J.Y.T., Li, H., Pinedo, M.: Order scheduling models: an overview. In: Kendall, G., Burke, E.K., Petrovic, S., Gendreau, M. (eds.) Multidisciplinary Scheduling: Theory and Applications. Springer, Boston (2005). https://doi.org/10.1007/0-387-27744-7_3
Leung, J.Y.T., Li, H., Pinedo, M.: Order scheduling in an environment with dedicated resources in parallel. J. Sched. 8(5), 355–386 (2005)
Li, X., Wang, Q., Wu, C.: Efficient composite heuristics for total flowtime minimization in permutation flow shops. Omega 37(1), 155–164 (2009)
Sung, C.S., Yoon, S.H.: Minimizing total weighted completion time at a pre-assembly stage composed of two feeding machines. Int. J. Prod. Econ. 54(3), 247–255 (1998)
Talbi, E.G.: Metaheuristics: From Design to Implementation, vol. 74. Wiley, Hoboken (2009)
Yang, J.: Scheduling with batch objectives. Ph.D. thesis, The Ohio State University (1998)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Riahi, V., Polash, M.M.A., Hakim Newton, M.A., Sattar, A. (2018). Mixed Neighbourhood Local Search for Customer Order Scheduling Problem. In: Geng, X., Kang, BH. (eds) PRICAI 2018: Trends in Artificial Intelligence. PRICAI 2018. Lecture Notes in Computer Science(), vol 11012. Springer, Cham. https://doi.org/10.1007/978-3-319-97304-3_23
Download citation
DOI: https://doi.org/10.1007/978-3-319-97304-3_23
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-97303-6
Online ISBN: 978-3-319-97304-3
eBook Packages: Computer ScienceComputer Science (R0)