Abstract
This paper discusses a two machines permutation flow-shop scheduling problem with uncertain job processing times, where the criterion is the weighted earliness and tardiness. Uncertain processing times are described by interval scenarios, and a robust scheduling model is established to minimize the maximum penalties for earliness and tardiness. The property for the worst-case scenario of processing times is discussed for this scheduling model. Based on the obtained conclusion, a two-layer harmony search algorithm is proposed to address the characteristic of two-layer searching space. The inner-layer harmony search algorithm is used for searching the scenario space for a given schedule, while the outer-layer harmony search algorithm is used for searching the min-max schedule space. Finally, an extensive experiment is conducted to testify the effectiveness of the proposed algorithm and the characteristics of the min-max robust solution obtained.
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
References
Wang, B., Yang, X.F., Li, Q.Y.: Bad-scenario set based risk-resisting robust scheduling model. Acta Autom. Sin. 38(2), 270–278 (2012)
Allahverdi, A., Aydilek, H.: Heuristics for the two-machine flow-shop scheduling problem to minimize makespan with bounded processing times. Int. J. Prod. Res. 48(21), 6367–6385 (2010)
Kouvelis, P., Yu, G.: Robust Discrete Optimization and its Applications, vol. 14. Springer Science & Business Media, Heidelberg (2013)
Liu, L., Gu, H.Y., Xi, Y.G.: Robust scheduling in a Just-in-time single machine system with processing time uncertainty. Control Decis. 22(10), 1151–1154 (2007)
Yang, H.A., Xi, Z.C., Xia, C.K., et al.: Minimax model and two space co-evolutionary genetic algorithm for job shop scheduling problem. China Mech. Eng. 26(3), 330–338 (2015)
Lenstra, J.K., Kan, A.R., Brucker, P.: Complexity of machine scheduling problems. Ann. Discret. Math. 1(4), 343–362 (1977)
Baker, K.R., Scudder, G.D.: Sequencing with earliness and tardiness penalties: a review. Oper. Res. 38(1), 22–36 (1990)
Moslehi, G., Mirzaee, M., Vasei, M., et al.: Two-machine flow shop scheduling to minimize the sum of maximum earliness and tardiness. Int. J. Prod. Econ. 122(2), 763–773 (2009)
Zegordi, S.H., Itoh, K., Enkawa, T.: A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem. Int. J. Prod. Res. 33(5), 1449–1466 (1995)
Schaller, J., Valente, J.S.: A comparison of metaheuristic operations to schedule jobs in a permutation flow shop to minimise total earliness and tardiness. Int. J. Prod. Res. 51(3), 772–779 (2013)
Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. Informs J. Comput. 6(2), 154–160 (1994)
Daniels, R.L., Kouvelis, P.: Robust scheduling to hedge against processing time uncertainty in single-stage production. Manag. Sci. 41(2), 363–376 (1995)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Wu, B., Wang, B., Han, X. (2017). Two-Layer Harmony Search Algorithm for a Robust Flow Shop Scheduling Problem. In: Yue, D., Peng, C., Du, D., Zhang, T., Zheng, M., Han, Q. (eds) Intelligent Computing, Networked Control, and Their Engineering Applications. ICSEE LSMS 2017 2017. Communications in Computer and Information Science, vol 762. Springer, Singapore. https://doi.org/10.1007/978-981-10-6373-2_26
Download citation
DOI: https://doi.org/10.1007/978-981-10-6373-2_26
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-6372-5
Online ISBN: 978-981-10-6373-2
eBook Packages: Computer ScienceComputer Science (R0)