Abstract
This paper presents an innovative hybrid estimation of distribution algorithm, named HEDA, for blocking flow-shop scheduling problem (BFSP) with sequence-dependent setup times (SDSTs) to minimize the makespan criterion, which has been proved to be typically NP-hard combinatorial optimization problem with strong engineering background. Firstly, several efficient heuristics are proposed according to the property of BFSP with SDSTs. Secondly, the genetic information of both the order of jobs and the promising blocks of jobs are concerned to generate the guided probabilistic model. Thirdly, after the HEDA-based global exploration, a reference sequence-based local search with path relinking technique is developed and incorporated into local exploitation to escape from local optima and improve the convergence property. Due to the reasonable balance between EDA-based global exploration and sequence dependent local exploitation as well as comprehensive utilization of the speedup evaluation method, the BFSP with SDSTs can be solved effectively and efficiently. Finally, computational results and comparisons with the existing state-of-the-art algorithms are carried out, which demonstrate the superiority of the proposed HEDA in terms of searching quality, robustness, and efficiency.
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
Allahverdi, A.: The third comprehensive survey on scheduling problems with setup times/costs. Eur. J. Oper. Res. 246, 345–378 (2015)
Hall, N.G., Sriskandarajah, C.: A survey of machine scheduling problems with blocking and no-wait in process. Oper. Res. 44(3), 510–525 (1996)
Wang, L., Pan, Q.K., Suganthan, P.N., Wang, W.H., Wang, Y.M.: A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems. Comput. Oper. Res. 37(3), 509–520 (2010)
Pan, Q.K., Wang, L.: Effective heuristics for the blocking flowshop scheduling problem with makespan minimization. Omega 40(2), 218–229 (2012)
Wang, C., Song, S., Gupta, J.N.D., Wu, C.: A three-phase algorithm for flowshop scheduling with blocking to minimize makespan. Comput. Oper. Res. 39(11), 2880–2887 (2012)
Ding, J.Y., Song, S., Gupta, J.N.D., Wang, C., Zhang, R., Wu, C.: New block properties for flowshop scheduling with blocking and their application in an iterated greedy algorithm. Int. J. Prod. Res. 54(16), 1–14 (2016)
Han, Y., Gong, D., Li, J., Zhang, Y.: Solving the blocking flow shop scheduling problem with makespan using a modified fruit fly optimisation algorithm. Int. J. Prod. Res. 54(22), 6782–6797 (2016)
Tasgetiren, M.F., Kizilay, D., Pan, Q.K., Suganthan, P.N.: Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion. Comput. Oper. Res. 77(C), 111–126 (2017)
Wang, L., Pan, Q.K., Tasgetiren, M.F.: Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms. Expert Syst. Appl. 37(12), 7929–7936 (2010)
Fernandez-Viagas, V., Leisten, R., Framinan, J.M.: A computational evaluation of constructive and improvement heuristics for the blocking flow shop to minimise total flowtime. Expert Syst. Appl. 61, 290–301 (2016)
Ronconi, D.P., Henriques, L.R.S.: Some heuristic algorithms for total tardiness minimization in a flowshop with blocking ☆. Omega 37(2), 272–281 (2009)
Nagano, M.S., Komesu, A.S., Mi, H.H.: An evolutionary clustering search for the total tardiness blocking flow shop problem. J. Intell. Manuf. 1–15 (2017)
Ribas, I., Companys, R., Tort-Martorell, X.: Efficient heuristics for the parallel blocking flow shop scheduling problem. Expert Syst. Appl. 74, 41–54 (2017)
Larranaga, P., Lozano, J.A.: Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Springer, Netherlands (2002). https://doi.org/10.1007/978-1-4615-1539-5
Ceberio, J., Irurozki, E., Mendiburu, A., Lozano, J.A.: A review on estimation of distribution algorithms in permutation-based combinatorial optimization problems. Prog. Artif. Intell. 1(1), 103–117 (2012)
Pan, Q.K., Ruiz, R.: An estimation of distribution algorithm for lot-streaming flow shop problems with setup times. Omega Int. J. Manag. Sci. 40(2), 166–180 (2012)
Wang, L., Wang, S.Y., Xu, Y., Zhou, G., Liu, M.: A bi-population based estimation of distribution algorithm for the flexible job-shop scheduling problem. Comput. Ind. Eng. 62, 917–926 (2012)
Wang, S.Y., Wang, L., Liu, M., Xu, Y.: An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem. Int. J. Prod. Econ. 145, 387–396 (2013)
Acknowledgments
The authors are sincerely grateful to the anonymous referees. This research is partially supported by the National Science Foundation of China (51665025), and the Applied Basic Research Foundation of Yunnan Province (2015FB136).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Zhang, ZQ., Qian, B., Liu, B., Hu, R., Zhang, CS. (2018). Hybrid Estimation of Distribution Algorithm for Blocking Flow-Shop Scheduling Problem with Sequence-Dependent Setup Times. In: Huang, DS., Bevilacqua, V., Premaratne, P., Gupta, P. (eds) Intelligent Computing Theories and Application. ICIC 2018. Lecture Notes in Computer Science(), vol 10954. Springer, Cham. https://doi.org/10.1007/978-3-319-95930-6_63
Download citation
DOI: https://doi.org/10.1007/978-3-319-95930-6_63
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-95929-0
Online ISBN: 978-3-319-95930-6
eBook Packages: Computer ScienceComputer Science (R0)