{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T20:34:38Z","timestamp":1776976478592,"version":"3.51.4"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,7,8]],"date-time":"2019-07-08T00:00:00Z","timestamp":1562544000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,7,8]],"date-time":"2019-07-08T00:00:00Z","timestamp":1562544000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s12351-019-00507-y","type":"journal-article","created":{"date-parts":[[2019,7,8]],"date-time":"2019-07-08T10:02:46Z","timestamp":1562580166000},"page":"2525-2542","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Variable neighborhood search algorithms for the permutation flowshop scheduling problem with the preventive maintenance"],"prefix":"10.1007","volume":"21","author":[{"given":"Wahiba","family":"Jomaa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0470-6946","authenticated-orcid":false,"given":"Mansour","family":"Eddaly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bassem","family":"Jarboui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,8]]},"reference":[{"issue":"3","key":"507_CR1","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1016\/S0377-2217(03)00261-3","volume":"153","author":"R Aggoune","year":"2004","unstructured":"Aggoune R (2004) Minimizing the makespan for the flow shop scheduling problem with availability constraints. Eur J Op Res 153(3):534\u2013543","journal-title":"Eur J Op Res"},{"key":"507_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-06290-7","volume-title":"Integrated maintenance planning in manufacturing systems","author":"O Al-Turki","year":"2014","unstructured":"Al-Turki O, Ayar T, Yilbas B-S, Sahin A-Z (2014) Integrated maintenance planning in manufacturing systems. Springer, Berlin"},{"issue":"1","key":"507_CR3","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.ijpe.2006.08.017","volume":"112","author":"H Allaoui","year":"2008","unstructured":"Allaoui H, Lamouri S, Artiba A, Aghezzaf E (2008) Simultaneously scheduling n jobs and the preventive maintenance on the two-machine flow shop to minimize the makespan. Int J Prod Econ 112(1):161\u2013167","journal-title":"Int J Prod Econ"},{"issue":"5","key":"507_CR4","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1016\/j.dam.2004.09.021","volume":"154","author":"DJ Aloise","year":"2006","unstructured":"Aloise DJ, Aloise D, Rocha CTM, Ribeiro CC, Ribeiro Filho JC, Moura LSS (2006) Scheduling workover rigs for onshore oil production. Discret Appl Math 154(5):695\u2013702 (IV ALIO\/EURO Workshop on Applied Combinatorial Optimization)","journal-title":"Discret Appl Math"},{"key":"507_CR5","doi-asserted-by":"crossref","unstructured":"Benbouzid-Si\u00a0Tayeb F, Belkaaloul W (2014) Towards an artificial immune system for scheduling jobs and preventive maintenance operations in flowshop problems. In 23rd IEEE international symposium on industrial electronics, ISIE 2014, Istanbul, Turkey, June 1-4, 2014, p 1065\u20131070","DOI":"10.1109\/ISIE.2014.6864761"},{"issue":"1","key":"507_CR6","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1504\/IJMR.2011.037912","volume":"6","author":"F Benbouzid-Sitayeb","year":"2011","unstructured":"Benbouzid-Sitayeb F, Guebli S-A, Bessadi Y, Varnier C, Zerhouni N (2011) Joint scheduling of jobs and preventive maintenance operations in the flowshop sequencing problem: a resolution with sequential and integrated strategies. Int J Manuf Res 6(1):30\u201348","journal-title":"Int J Manuf Res"},{"issue":"10","key":"507_CR7","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1504\/EJIE.2010.035652","volume":"4","author":"W Besbes","year":"2010","unstructured":"Besbes W, Teghem J, Loukil T (2010) Scheduling hybrid flow shop problem with non-fixed availability constraints. Eur J Ind Eng 4(10):413\u2013433","journal-title":"Eur J Ind Eng"},{"key":"507_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14952-8","volume-title":"Reliability engineering: theory and practice","author":"A Birolini","year":"2010","unstructured":"Birolini A (2010) Reliability engineering: theory and practice. Springer, Berlin"},{"issue":"2","key":"507_CR9","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R\u00a0L Graham","year":"1979","unstructured":"Graham R\u00a0L, Lawler E\u00a0L, Lenstra J\u00a0K, Kan A\u00a0H\u00a0G Rinnooy (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discret Math 5(2):287\u2013326","journal-title":"Ann Discret Math"},{"issue":"3","key":"507_CR10","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen P, Mladenovi\u0107 N (2001) Variable neighborhood search: principles and applications. Eur J Op Res 130(3):449\u2013467","journal-title":"Eur J Op Res"},{"key":"507_CR11","doi-asserted-by":"publisher","first-page":"2638","DOI":"10.1016\/j.cor.2008.11.004","volume":"36","author":"B Jarboui","year":"2009","unstructured":"Jarboui B, Eddaly M, Siarry P (2009) An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems. Comput Op Res 36:2638\u20132646","journal-title":"Comput Op Res"},{"issue":"3","key":"507_CR12","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1016\/S0377-2217(01)00083-2","volume":"136","author":"W Kubiak","year":"2002","unstructured":"Kubiak W, B\u0142a\u017cewicz J, Formanowicz P, Breit J, Schmidt G (2002) Two-machine flow shops with limited machine availability. Eur J Op Res 136(3):528\u2013540","journal-title":"Eur J Op Res"},{"key":"507_CR13","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.cor.2016.02.005","volume":"72","author":"Y Laalaoui","year":"2016","unstructured":"Laalaoui Y, M\u2019Hallah R (2016) A binary multiple knapsack model for single machine scheduling with machine unavailability. Comput Op Res 72:71\u201382","journal-title":"Comput Op Res"},{"key":"507_CR14","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1016\/j.procs.2017.08.120","volume":"112","author":"A Ladj","year":"2017","unstructured":"Ladj A, Tayeb F\u00a0Benbouzid-Si, Varnier C, Dridi A-A, Selmane N (2017) A hybrid of variable neighbor search and fuzzy logic for the permutation flowshop scheduling problem with predictive maintenance. Procedia Comput Sci 112:663\u2013672","journal-title":"Procedia Comput Sci"},{"issue":"3","key":"507_CR15","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0167-6377(96)00041-7","volume":"20","author":"C-Y Lee","year":"1997","unstructured":"Lee C-Y (1997) Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint. Op Res Lett 20(3):129\u2013139","journal-title":"Op Res Lett"},{"issue":"2","key":"507_CR16","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1002\/(SICI)1520-6750(200003)47:2<145::AID-NAV5>3.0.CO;2-3","volume":"47","author":"C-Y Lee","year":"2000","unstructured":"Lee C-Y, Chen Z-L (2000) Scheduling jobs and maintenance activities on parallel machines. Nav Res Logist (NRL) 47(2):145\u2013165","journal-title":"Nav Res Logist (NRL)"},{"issue":"11","key":"507_CR17","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107 N, Hansen P (1997) Variable neighborhood search. Comput Op Res 24(11):1097\u20131100","journal-title":"Comput Op Res"},{"key":"507_CR18","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/j.trc.2018.03.013","volume":"90","author":"MK Msakni","year":"2018","unstructured":"Msakni MK, Haouari M (2018) Short-term planning of liquefied natural gas deliveries. Transp Res Part C Emerg Technol 90:393\u2013410","journal-title":"Transp Res Part C Emerg Technol"},{"key":"507_CR19","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/3-540-61723-X_982","volume-title":"Parallel problem solving from nature\u2013PPSN IV","author":"H M\u00fchlenbein","year":"1996","unstructured":"M\u00fchlenbein H, Paa\u00df G (1996) From recombination of genes to the estimation of distributions i. binary parameters. In: Voigt H-M, Ebeling W, Rechenberg I, Schwefel H-P (eds) Parallel problem solving from nature\u2013PPSN IV. Springer, Berlin, pp 178\u2013187"},{"issue":"2","key":"507_CR20","doi-asserted-by":"publisher","first-page":"2094","DOI":"10.1016\/j.asoc.2010.07.008","volume":"11","author":"B Naderi","year":"2011","unstructured":"Naderi B, Zandieh M, Aminnayeri M (2011) Incorporating periodic preventive maintenance into flexible flowshop scheduling problems. Appl Soft Comput 11(2):2094\u20132101","journal-title":"Appl Soft Comput"},{"issue":"1","key":"507_CR21","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz M, Enscor E-E, Ham I (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11(1):91\u201395","journal-title":"Omega"},{"issue":"6","key":"507_CR22","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1016\/0305-0483(89)90059-5","volume":"17","author":"I-H Osman","year":"1989","unstructured":"Osman I-H, Potts C-N (1989) Simulated annealing for permutation flow-shop scheduling. Omega 17(6):551\u2013557","journal-title":"Omega"},{"key":"507_CR23","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.knosys.2018.01.018","volume":"145","author":"J Pacheco","year":"2018","unstructured":"Pacheco J, Porras S, Casado S, Baruque B (2018) Variable neighborhood search with memory for a single-machine scheduling problem with periodic maintenance and sequence-dependent set-up times. Knowl-Based Syst 145:236\u2013249","journal-title":"Knowl-Based Syst"},{"issue":"2","key":"507_CR24","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1016\/S0377-2217(02)00908-6","volume":"155","author":"C Rajendran","year":"2004","unstructured":"Rajendran C, Ziegler H (2004) Ant-colony algorithms for permutation flowshop scheduling to minimize makespan\/total flowtime of jobs. Eur J Op Res 155(2):426\u2013438","journal-title":"Eur J Op Res"},{"issue":"11","key":"507_CR25","doi-asserted-by":"publisher","first-page":"3314","DOI":"10.1016\/j.cor.2005.12.007","volume":"34","author":"R Ruiz","year":"2007","unstructured":"Ruiz R, Garcia-Diaz J-C, Maroto C (2007) Considering scheduling and preventive maintenance in the flowshop sequencing problem. Comput Op Res 34(11):3314\u20133330","journal-title":"Comput Op Res"},{"issue":"5","key":"507_CR26","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1016\/j.omega.2004.12.006","volume":"34","author":"R Ruiz","year":"2006","unstructured":"Ruiz R, Maroto C, Alcaraz C (2006) Two new robust genetic algorithms for the flowshop scheduling problem. Omega 34(5):461\u2013476","journal-title":"Omega"},{"issue":"2","key":"507_CR27","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/j.ejor.2016.01.014","volume":"252","author":"R Todosijevi\u0107","year":"2016","unstructured":"Todosijevi\u0107 R, Benmansour R, Hanafi S, Mladenovi\u0107 N, Artiba A (2016) Nested general variable neighborhood search for the periodic maintenance problem. Eur J Op Res 252(2):385\u2013396","journal-title":"Eur J Op Res"},{"issue":"2","key":"507_CR28","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/0377-2217(89)90383-4","volume":"41","author":"M Widmer","year":"1989","unstructured":"Widmer M, Hertz A (1989) A new heuristic method for the flow shop sequencing problem. Eur J Op Res 41(2):186\u2013193","journal-title":"Eur J Op Res"},{"issue":"6","key":"507_CR29","doi-asserted-by":"publisher","first-page":"1809","DOI":"10.1016\/j.cor.2008.05.001","volume":"36","author":"D Xu","year":"2009","unstructured":"Xu D, Cheng Z, Yin Y, Li H (2009) Makespan minimization for two parallel machines scheduling with a periodic availability constraint. Comput Op Res 36(6):1809\u20131812","journal-title":"Comput Op Res"},{"issue":"4","key":"507_CR30","doi-asserted-by":"publisher","first-page":"1344","DOI":"10.1016\/j.cor.2006.08.015","volume":"35","author":"D Xu","year":"2008","unstructured":"Xu D, Sun K, Li H (2008) Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan. Comput Op Res 35(4):1344\u20131349","journal-title":"Comput Op Res"},{"issue":"14","key":"507_CR31","doi-asserted-by":"publisher","first-page":"7561","DOI":"10.1016\/j.apm.2013.03.001","volume":"37","author":"D Xu","year":"2013","unstructured":"Xu D, Yang D-L (2013) Makespan minimization for two parallel machines scheduling with a periodic availability constraint: mathematical programming model, average-case analysis, and anomalies. Appl Math Model 37(14):7561\u20137567","journal-title":"Appl Math Model"},{"issue":"3","key":"507_CR32","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1016\/j.cor.2006.04.007","volume":"35","author":"D-L Yang","year":"2008","unstructured":"Yang D-L, Hsu C-J, Kuo W-H (2008) A two-machine flowshop scheduling problem with a separated maintenance constraint. Comput Op Res 35(3):876\u2013883 (Part Special Issue: New Trends in Locational Analysis)","journal-title":"Comput Op Res"},{"issue":"1","key":"507_CR33","first-page":"46","volume":"4","author":"M Yazdani","year":"2017","unstructured":"Yazdani M, Khalili S\u00a0Mohammad, Babagolzadeh M, Jolai F (2017) A single-machine scheduling problem with multiple unavailability constraints: a mathematical model and an enhanced variable neighborhood search approach. J Comput Des Eng 4(1):46\u201359","journal-title":"J Comput Des Eng"},{"issue":"2","key":"507_CR34","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.cie.2009.04.014","volume":"58","author":"M Ying","year":"2010","unstructured":"Ying M, Chengbin C, Chunrong Z (2010) A survey of scheduling with deterministic machine availability constraints. Comput Ind Eng 58(2):199\u2013211 (Scheduling in Healthcare and Industrial Systems)","journal-title":"Comput Ind Eng"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-019-00507-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-019-00507-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-019-00507-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,22]],"date-time":"2021-10-22T18:18:33Z","timestamp":1634926713000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-019-00507-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,8]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["507"],"URL":"https:\/\/doi.org\/10.1007\/s12351-019-00507-y","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,8]]},"assertion":[{"value":"5 April 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 April 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 July 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 July 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}