{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:01:56Z","timestamp":1743040916459,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319959290"},{"type":"electronic","value":"9783319959306"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-95930-6_63","type":"book-chapter","created":{"date-parts":[[2018,7,5]],"date-time":"2018-07-05T06:12:40Z","timestamp":1530771160000},"page":"628-637","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Hybrid Estimation of Distribution Algorithm for Blocking Flow-Shop Scheduling Problem with Sequence-Dependent Setup Times"],"prefix":"10.1007","author":[{"given":"Zi-Qi","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chang-Sheng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,6]]},"reference":[{"key":"63_CR1","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.ejor.2015.04.004","volume":"246","author":"A Allahverdi","year":"2015","unstructured":"Allahverdi, A.: The third comprehensive survey on scheduling problems with setup times\/costs. Eur. J. Oper. Res. 246, 345\u2013378 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"63_CR2","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1287\/opre.44.3.510","volume":"44","author":"NG Hall","year":"1996","unstructured":"Hall, N.G., Sriskandarajah, C.: A survey of machine scheduling problems with blocking and no-wait in process. Oper. Res. 44(3), 510\u2013525 (1996)","journal-title":"Oper. Res."},{"issue":"3","key":"63_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/j.cor.2008.12.004","volume":"37","author":"L Wang","year":"2010","unstructured":"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\u2013520 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"63_CR4","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.omega.2011.06.002","volume":"40","author":"QK Pan","year":"2012","unstructured":"Pan, Q.K., Wang, L.: Effective heuristics for the blocking flowshop scheduling problem with makespan minimization. Omega 40(2), 218\u2013229 (2012)","journal-title":"Omega"},{"issue":"11","key":"63_CR5","doi-asserted-by":"publisher","first-page":"2880","DOI":"10.1016\/j.cor.2012.02.020","volume":"39","author":"C Wang","year":"2012","unstructured":"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\u20132887 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"16","key":"63_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/00207543.2015.1076941","volume":"54","author":"JY Ding","year":"2016","unstructured":"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\u201314 (2016)","journal-title":"Int. J. Prod. Res."},{"issue":"22","key":"63_CR7","doi-asserted-by":"publisher","first-page":"6782","DOI":"10.1080\/00207543.2016.1177671","volume":"54","author":"Y Han","year":"2016","unstructured":"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\u20136797 (2016)","journal-title":"Int. J. Prod. Res."},{"key":"63_CR8","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.cor.2016.07.002","volume":"77","author":"M. Fatih Tasgetiren","year":"2017","unstructured":"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\u2013126 (2017)","journal-title":"Computers & Operations Research"},{"issue":"12","key":"63_CR9","doi-asserted-by":"publisher","first-page":"7929","DOI":"10.1016\/j.eswa.2010.04.042","volume":"37","author":"L Wang","year":"2010","unstructured":"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\u20137936 (2010)","journal-title":"Expert Syst. Appl."},{"key":"63_CR10","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.eswa.2016.05.040","volume":"61","author":"V Fernandez-Viagas","year":"2016","unstructured":"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\u2013301 (2016)","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"63_CR11","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/j.omega.2007.01.003","volume":"37","author":"DP Ronconi","year":"2009","unstructured":"Ronconi, D.P., Henriques, L.R.S.: Some heuristic algorithms for total tardiness minimization in a flowshop with blocking \u2606. Omega 37(2), 272\u2013281 (2009)","journal-title":"Omega"},{"doi-asserted-by":"crossref","unstructured":"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\u201315 (2017)","key":"63_CR12","DOI":"10.1007\/s10845-017-1358-7"},{"key":"63_CR13","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.eswa.2017.01.006","volume":"74","author":"I Ribas","year":"2017","unstructured":"Ribas, I., Companys, R., Tort-Martorell, X.: Efficient heuristics for the parallel blocking flow shop scheduling problem. Expert Syst. Appl. 74, 41\u201354 (2017)","journal-title":"Expert Syst. Appl."},{"key":"63_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-1539-5","volume-title":"Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation","author":"P Larranaga","year":"2002","unstructured":"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"},{"issue":"1","key":"63_CR15","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s13748-011-0005-3","volume":"1","author":"J Ceberio","year":"2012","unstructured":"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\u2013117 (2012)","journal-title":"Prog. Artif. Intell."},{"issue":"2","key":"63_CR16","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.omega.2011.05.002","volume":"40","author":"Quan-Ke Pan","year":"2012","unstructured":"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\u2013180 (2012)","journal-title":"Omega"},{"key":"63_CR17","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1016\/j.cie.2011.12.014","volume":"62","author":"L Wang","year":"2012","unstructured":"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\u2013926 (2012)","journal-title":"Comput. Ind. Eng."},{"key":"63_CR18","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/j.ijpe.2013.05.004","volume":"145","author":"SY Wang","year":"2013","unstructured":"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\u2013396 (2013)","journal-title":"Int. J. Prod. Econ."}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Theories and Application"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-95930-6_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T12:21:12Z","timestamp":1710246072000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-95930-6_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319959290","9783319959306"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-95930-6_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"6 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wuhan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ic-ic.tongji.edu.cn\/2018\/index.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"LOD","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"632","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"275","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.46","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}