{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T15:13:20Z","timestamp":1724166800310},"reference-count":37,"publisher":"EDP Sciences","issue":"3","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"vor","delay-in-days":45,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2021,5,3]]},"published-print":{"date-parts":[[2021,5]]},"abstract":"Nowadays many industry consider an interval time as a due date instead of precise points in time. In this study, the hybrid flow shop scheduling problem with basic blocking constraint is tackled. Where jobs, if done within a due window, are deemed on time. Therefore, the criterion is to minimize the sum of weighted earliness and tardiness. This variant of the hybrid flowshop problem is not investigated to the best of our knowledge. we introduced a new metaheuristic centered on the iterated greedy approach. to evaluate the proposed method we start by the re-implementation and the comparison of seven well-selected procedures that treat the hybrid flowshop problem. In order to prove the robustness of our method, we evaluated it using a new benchmark of more than 1000 instances. The experimental results demonstrated that the proposed algorithm is effective and produces a very high solution.<\/jats:p>","DOI":"10.1051\/ro\/2021076","type":"journal-article","created":{"date-parts":[[2021,5,5]],"date-time":"2021-05-05T19:03:14Z","timestamp":1620241394000},"page":"1603-1616","source":"Crossref","is-referenced-by-count":19,"title":["An effective iterated greedy algorithm for blocking hybrid flow shop problem with due date window"],"prefix":"10.1051","volume":"55","author":[{"given":"Ahmed","family":"Missaoui","sequence":"first","affiliation":[]},{"given":"Youn\u00e8s","family":"Boujelbene","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1016\/j.ejor.2019.10.004","volume":"282","author":"Alfaro-Fern\u00e0ndez","year":"2020","journal-title":"Eur. J. Oper. Res."},{"key":"R2","doi-asserted-by":"crossref","first-page":"104196","DOI":"10.1016\/j.engappai.2021.104196","volume":"100","author":"Aqil","year":"2021","journal-title":"Eng. Appl. Artif. Intell."},{"key":"R3","doi-asserted-by":"crossref","unstructured":"Bartz-Beielstein T., Chiarandini M., Paquete L. and Preuss M., Experimental Methods for the Analysis of Optimization Algorithms. Springer (2010).","DOI":"10.1007\/978-3-642-02538-9"},{"key":"R4","doi-asserted-by":"crossref","first-page":"2543","DOI":"10.1016\/j.cor.2013.01.024","volume":"40","author":"Elmi","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"R5","doi-asserted-by":"crossref","first-page":"1083","DOI":"10.1016\/j.future.2004.03.014","volume":"20","author":"Engin","year":"2004","journal-title":"Future Gener. Comput. Syst."},{"key":"R6","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.ejor.2010.03.030","volume":"207","author":"Fanjul-Peyro","year":"2010","journal-title":"Eur. J. Oper. Res."},{"key":"R7","doi-asserted-by":"crossref","unstructured":"Framinan J.M., Leisten R. and Garc\u00eda R.R., Manufacturing scheduling systems. In: An Integrated View on Models, Methods and Tools (2014) 51\u201363.","DOI":"10.1007\/978-1-4471-6272-8"},{"key":"R8","first-page":"125","volume":"3","author":"Grabowski","year":"1999","journal-title":"Stanis lawa Staszica w Krakowie"},{"key":"R9","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"Graham","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"R10","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1287\/opre.44.3.510","volume":"44","author":"Hall","year":"1996","journal-title":"Oper. Res."},{"key":"R11","doi-asserted-by":"crossref","first-page":"8248","DOI":"10.1016\/j.amc.2011.02.108","volume":"217","author":"Hidri","year":"2011","journal-title":"Appl. Math. Comput."},{"key":"R12","doi-asserted-by":"crossref","first-page":"106629","DOI":"10.1016\/j.asoc.2020.106629","volume":"96","author":"Jing","year":"2020","journal-title":"Appl. Soft Comput."},{"key":"R13","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1080\/18756891.2008.9727611","volume":"1","author":"Kahraman","year":"2008","journal-title":"Int. J. Comput. Intell. Syst."},{"key":"R14","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1016\/j.cie.2019.06.057","volume":"135","author":"Khare","year":"2019","journal-title":"Comput. Ind. Eng."},{"key":"R15","first-page":"211","volume":"24","author":"Lebbar","year":"2018","journal-title":"Int. J. Oper. Quant. Manage."},{"key":"R16","doi-asserted-by":"crossref","first-page":"2237","DOI":"10.1016\/j.asoc.2012.03.025","volume":"12","author":"Lei","year":"2012","journal-title":"Appl. Soft Comput."},{"key":"R17","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/s40430-018-0980-4","volume":"40","author":"Moccellin","year":"2018","journal-title":"J. Braz. Soc. Mech. Sci. Eng."},{"key":"R18","doi-asserted-by":"crossref","first-page":"9625","DOI":"10.1016\/j.eswa.2008.09.063","volume":"36","author":"Naderi","year":"2009","journal-title":"Expert Syst. Appl."},{"key":"R19","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.cor.2019.04.024","volume":"109","author":"Newton","year":"2019","journal-title":"Comput. Oper. Res."},{"key":"R20","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1109\/TASE.2012.2204874","volume":"10","author":"Pan","year":"2012","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"R21","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.amc.2017.01.004","volume":"303","author":"Pan","year":"2017","journal-title":"Appl. Math. Comput."},{"key":"R22","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.cor.2016.11.022","volume":"80","author":"Pan","year":"2017","journal-title":"Comput. Oper. Res."},{"key":"R23","doi-asserted-by":"crossref","first-page":"3202","DOI":"10.1016\/j.cor.2007.02.014","volume":"35","author":"Pezzella","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"R24","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0167-6377(82)90035-9","volume":"1","author":"Potts","year":"1982","journal-title":"Oper. Res. Lett."},{"key":"R25","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1007\/s10732-014-9279-5","volume":"22","author":"Pranzo","year":"2016","journal-title":"J. Heurist."},{"key":"R26","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1007\/s00170-009-2475-z","volume":"49","author":"Rashidi","year":"2010","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"R27","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/j.omega.2010.07.007","volume":"39","author":"Ribas","year":"2011","journal-title":"Omega"},{"key":"R28","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/j.eswa.2018.12.039","volume":"121","author":"Ribas","year":"2019","journal-title":"Expert Syst. Appl."},{"key":"R29","doi-asserted-by":"crossref","first-page":"2033","DOI":"10.1016\/j.ejor.2005.12.009","volume":"177","author":"Ruiz","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"R30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2009.09.024","volume":"205","author":"Ruiz","year":"2010","journal-title":"Eur. J. Oper. Res."},{"key":"R31","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/j.omega.2018.03.004","volume":"83","author":"Ruiz","year":"2019","journal-title":"Omega"},{"key":"R32","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1002\/asm.3150090206","volume":"9","author":"Sawik","year":"1993","journal-title":"Appl. Stoch. Models Data Anal."},{"key":"R33","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.cor.2016.07.002","volume":"77","author":"Tasgetiren","year":"2017","journal-title":"Comput. Oper. Res."},{"key":"R34","unstructured":"Trabelsi W., Sauvey C. and Sauer N., A genetic algorithm for hybrid flowshop problem with mixed blocking constraints. In: IFAC Conference on Manufacturing, Modelling, Management and Control (2013)."},{"key":"R35","doi-asserted-by":"crossref","unstructured":"Yuan K., Sauer N. and Sauvey C., Application of em algorithm to hybrid flow shop scheduling problems with a special blocking. In: 2009 IEEE Conference on Emerging Technologies & Factory Automation. IEEE (2009) 1\u20137.","DOI":"10.1109\/ETFA.2009.5347066"},{"key":"R36","unstructured":"Zeng Q. and Yang Z., A hbrid flow shop scheduling model for loading outbound containers in container terminals. In: Proceedings of the Eastern Asia Society for Transportation Studies Vol. 6 (The 7th International Conference of Eastern Asia Society for Transportation Studies, 2007). Eastern Asia Society for Transportation Studies (2007) 381."},{"key":"R37","doi-asserted-by":"crossref","unstructured":"Zhang Y., Liang X., Li W. and Zhang Y., Hybrid flow shop problem with blocking and multi-product families in a maritime terminal. In: 2013 10th IEEE International Conference on Networking, Sensing and Control (ICNSC). IEEE (2013) 59\u201364.","DOI":"10.1109\/ICNSC.2013.6548711"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2021076\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,3]],"date-time":"2023-11-03T08:47:54Z","timestamp":1699001274000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2021076"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5]]},"references-count":37,"journal-issue":{"issue":"3"},"alternative-id":["ro200453"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2021076","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5]]}}}