{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T22:37:57Z","timestamp":1698187077329},"reference-count":48,"publisher":"EDP Sciences","issue":"1","license":[{"start":{"date-parts":[[2019,2,15]],"date-time":"2019-02-15T00:00:00Z","timestamp":1550188800000},"content-version":"vor","delay-in-days":45,"URL":"https:\/\/www.edpsciences.org\/en\/authors\/copyright-and-licensing"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2018,7,28]]},"published-print":{"date-parts":[[2019,1]]},"abstract":"<jats:p>In the literature, some works deal with the two-machine flow shop scheduling problem under availability constraints. Most of them consider those constraints only for one machine at a time and also with limited unavailability periods. In this work, we were interested by the unlimited periodic and synchronized maintenance applied on both machines. The problem is NP-hard. We proposed a mixed integer programming model and a variable neighborhood search for solving large instances in order to minimize the makespan. Computational experiments show the efficiency of the proposed methods.<\/jats:p>","DOI":"10.1051\/ro\/2018062","type":"journal-article","created":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T10:23:53Z","timestamp":1533119033000},"page":"351-365","source":"Crossref","is-referenced-by-count":6,"title":["Two-machine flow shop with synchronized periodic maintenance"],"prefix":"10.1051","volume":"53","author":[{"given":"Issam","family":"Krimi","sequence":"first","affiliation":[]},{"given":"Rachid","family":"Benmansour","sequence":"additional","affiliation":[]},{"given":"Sa\u00efd","family":"Hanafi","sequence":"additional","affiliation":[]},{"given":"Nizar","family":"Elhachemi","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2019,2,15]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1016\/j.ijpe.2004.12.002","volume":"99","author":"Aggoune","year":"2006","journal-title":"Int. J. Prod. Econ."},{"key":"R2","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.cor.2014.02.004","volume":"47","author":"Benmansour","year":"2014","journal-title":"Comput. Oper. Res."},{"key":"R3","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/j.ifacol.2016.11.023","volume":"49","author":"Benttaleb","year":"2016","journal-title":"IFAC-PapersOnLine"},{"key":"R4","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1016\/S0305-0483(01)00048-2","volume":"29","author":"B\u0142a\u017cewicz","year":"2001","journal-title":"Omega"},{"key":"R5","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.ipl.2004.03.004","volume":"90","author":"Breit","year":"2004","journal-title":"Inf. Process. Lett."},{"key":"R6","doi-asserted-by":"crossref","first-page":"2143","DOI":"10.1016\/j.cor.2005.01.004","volume":"33","author":"Breit","year":"2006","journal-title":"Comput. Oper. Res."},{"key":"R7","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/S0020-0190(99)00094-0","volume":"71","author":"Cheng","year":"1999","journal-title":"Inf. Process. Lett."},{"key":"R8","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0167-6377(00)00033-X","volume":"26","author":"Cheng","year":"2000","journal-title":"Oper. Res. Lett."},{"key":"R9","doi-asserted-by":"crossref","first-page":"6273","DOI":"10.1080\/00207543.2010.531775","volume":"49","author":"Ben Chihaoui","year":"2011","journal-title":"Int. J. Prod. Res."},{"key":"R10","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1016\/S0360-8352(99)00127-8","volume":"37","author":"Espinouse","year":"1999","journal-title":"Comput. Ind. Eng."},{"key":"R11","doi-asserted-by":"crossref","unstructured":"Gara-Ali A. and Espinouse M.L., A two-machine flowshop with a deteriorating maintenance activity on the second machine. In: Industrial Engineering and Systems Management (IESM), 2015 International Conference on. IEEE (2015) 481\u2013488.","DOI":"10.1109\/IESM.2015.7380202"},{"key":"R12","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"Garey","year":"1976","journal-title":"Math. Oper. Res."},{"key":"R13","unstructured":"Gholizadeh H., Tavakkoli-Moghaddam R. and Tootooni B., Minimizing the makespan in a flow shop scheduling problem with sequence-dependent setup times and periodic maintenance by a hybrid algorithm. In: 2012 International Conference on Industrial Engineering and Operations Management (2012) 806\u2013814."},{"key":"R14","unstructured":"Glover F.W. and Kochenberger G.A., Handbook of Metaheuristics, Vol. 57. Springer Science & Business Media, Berlin (2006)."},{"key":"R15","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":"R16","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1007\/s11590-011-0281-7","volume":"6","author":"Hadda","year":"2012","journal-title":"Optim. Lett."},{"key":"R17","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s10288-009-0102-3","volume":"8","author":"Hadda","year":"2010","journal-title":"40R-Q J. Oper. Res."},{"key":"R18","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/s11590-009-0137-6","volume":"3","author":"Hadda","year":"2009","journal-title":"Optim. Lett."},{"key":"R19","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1007\/s12597-017-0298-5","volume":"54","author":"Hadda","year":"2017","journal-title":"OPSEARCH"},{"key":"R20","doi-asserted-by":"crossref","first-page":"802","DOI":"10.1016\/j.dam.2005.05.020","volume":"154","author":"Hansen","year":"2006","journal-title":"Discrete Appl. Math."},{"key":"R21","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"Hansen","year":"2010","journal-title":"Ann. Oper. Res."},{"key":"R22","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","volume":"5","author":"Hansen","year":"2016","journal-title":"EURO J. Comput. Optim."},{"key":"R23","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.ijpe.2015.02.025","volume":"164","author":"Hnaien","year":"2015","journal-title":"Int. J. Prod. Econ."},{"key":"R24","doi-asserted-by":"crossref","first-page":"1764","DOI":"10.1016\/j.cor.2005.05.034","volume":"34","author":"Ji","year":"2007","journal-title":"Comput. Oper. Res."},{"key":"R25","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"Johnson","year":"1954","journal-title":"Nav. Res. Logist. Quart."},{"key":"R26","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/j.ijpe.2007.01.013","volume":"112","author":"Kacem","year":"2008","journal-title":"Int. J. Prod. Econ."},{"key":"R27","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1016\/j.cor.2006.04.010","volume":"35","author":"Kacem","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"R28","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s10878-013-9643-7","volume":"30","author":"Kacem","year":"2015","journal-title":"J. Comb. Optim."},{"key":"R29","doi-asserted-by":"crossref","first-page":"1177","DOI":"10.1051\/ro\/2017044","volume":"51","author":"Kacem","year":"2017","journal-title":"RAIRO: OR"},{"key":"R30","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1016\/S0377-2217(01)00083-2","volume":"136","author":"Kubiak","year":"2002","journal-title":"Eur. J. Oper. Res."},{"key":"R31","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/j.cor.2007.10.013","volume":"36","author":"Kubzin","year":"2009","journal-title":"Comput. Oper. Res."},{"key":"R32","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10288-005-0070-1","volume":"3","author":"Kubzin","year":"2005","journal-title":"4OR: A Quart. J. Oper. Res."},{"key":"R33","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1287\/opre.1060.0301","volume":"54","author":"Kubzin","year":"2006","journal-title":"Oper. Res."},{"key":"R34","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF00121681","volume":"9","author":"Lee","year":"1996","journal-title":"J. Global Optim."},{"key":"R35","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0167-6377(96)00041-7","volume":"20","author":"Lee","year":"1997","journal-title":"Oper. Res. Lett."},{"key":"R36","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1016\/S0377-2217(97)00452-9","volume":"114","author":"Lee","year":"1999","journal-title":"Eur. J. Oper. Res."},{"key":"R37","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/j.cie.2008.06.003","volume":"56","author":"Liao","year":"2009","journal-title":"Comput. Ind. Eng."},{"key":"R38","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.cie.2009.04.014","volume":"58","author":"Ma","year":"2010","journal-title":"Comput. Ind. Eng."},{"key":"R39","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"Mladenovi\u0107","year":"2001","journal-title":"Eur. J. Oper. Res."},{"key":"R40","doi-asserted-by":"crossref","first-page":"2094","DOI":"10.1016\/j.asoc.2010.07.008","volume":"11","author":"Naderi","year":"2011","journal-title":"Appl. Soft Comput."},{"key":"R41","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1002\/nav.10107","volume":"51","author":"Ng","year":"2004","journal-title":"Nav. Res. Logistics (NRL)"},{"key":"R42","first-page":"360","volume":"1","author":"Saidy","year":"2008","journal-title":"J. Ind Syst. Eng."},{"key":"R43","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(98)00367-1","volume":"121","author":"Schmidt","year":"2000","journal-title":"Eur. J. Oper. Res."},{"key":"R44","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/j.ejor.2016.01.014","volume":"252","author":"Todosijevi\u0107","year":"2016","journal-title":"Eur. J. Oper. Res."},{"key":"R45","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1016\/j.cor.2005.05.003","volume":"34","author":"Wang","year":"2007","journal-title":"Comput. Oper. Res."},{"key":"R46","doi-asserted-by":"crossref","first-page":"1809","DOI":"10.1016\/j.cor.2008.05.001","volume":"36","author":"Xu","year":"2009","journal-title":"Comput. Oper. Res."},{"key":"R47","doi-asserted-by":"crossref","first-page":"7561","DOI":"10.1016\/j.apm.2013.03.001","volume":"37","author":"Xu","year":"2013","journal-title":"Appl. Math. Model."},{"key":"R48","doi-asserted-by":"crossref","first-page":"876","DOI":"10.1016\/j.cor.2006.04.007","volume":"35","author":"Yang","year":"2008","journal-title":"Comput. Oper. Res."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2018062\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,28]],"date-time":"2020-08-28T18:59:07Z","timestamp":1598641147000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2018062"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":48,"journal-issue":{"issue":"1"},"alternative-id":["ro170222"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2018062","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1]]}}}