{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T01:19:47Z","timestamp":1773883187737,"version":"3.50.1"},"reference-count":35,"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":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2018,6,27]]},"published-print":{"date-parts":[[2019,1]]},"abstract":"<jats:p>In this paper we propose to solve a single machine scheduling problem which has to undergo a periodic preventive maintenance. The objective is to minimize the weighted sum of the completion times. This criterion is defined as one of the most important objectives in practice but has not been studied so far for the considered problem. As the problem is proven to be NP-hard, and a mathematical model is proposed in the literature, we propose to use General Variable Neighborhood Search algorithm to solve this problem in order to obtain near optimal solutions for the large-sized instances in a small amount of computational time.<\/jats:p>","DOI":"10.1051\/ro\/2018055","type":"journal-article","created":{"date-parts":[[2018,6,29]],"date-time":"2018-06-29T08:28:37Z","timestamp":1530260917000},"page":"289-302","source":"Crossref","is-referenced-by-count":11,"title":["A variable neighborhood search algorithm for solving the single machine scheduling problem with periodic maintenance"],"prefix":"10.1051","volume":"53","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0522-3460","authenticated-orcid":false,"given":"Hanane","family":"Krim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rachid","family":"Benmansour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Duvivier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdelhakim","family":"Artiba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2019,2,15]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"2041","DOI":"10.1016\/j.apm.2010.11.017","volume":"35","author":"\u00c1ngel-Bello","year":"2011","journal-title":"Appl. Math. Model."},{"key":"R2","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1108\/13552510510601311","volume":"11","author":"Artiba","year":"2005","journal-title":"J. Qual. Main. Eng."},{"key":"R3","unstructured":"Ashour S., Sequencing Theory. Vol 69. Springer Science & Business Media. Springer Berlin, Heidelberg, New York (2012)."},{"key":"R4","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0166-218X(92)90255-9","volume":"36","author":"Belouadah","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"R5","doi-asserted-by":"crossref","unstructured":"Ben-Daya M., Ait-Kadi D., Duffuaa S.O., Knezevic J. and Raouf A., Handbook of maintenance management and engineering. Vol 7. Springer, Springer Dordrecht Heidelberg London New York (2009).","DOI":"10.1007\/978-1-84882-472-0"},{"key":"R6","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":"R7","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1057\/palgrave.jors.2601998","volume":"57","author":"Chen","year":"2006","journal-title":"J. Oper. Res. Soc."},{"key":"R8","doi-asserted-by":"crossref","first-page":"1173","DOI":"10.1007\/s00170-006-0689-x","volume":"34","author":"Chen","year":"2007","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"R9","unstructured":"Cruzan R., Manager\u2019s Guide to Preventive Building Maintenance. The Fairmont Press, INC. 711 Indian trail Lilburn, GA 300047 (1970)."},{"key":"R10","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.cor.2016.11.008","volume":"80","author":"Cui","year":"2017","journal-title":"Comput. Oper. Res."},{"key":"R11","first-page":"11","volume":"2013","author":"Ebrahimy Zade","year":"2013","journal-title":"Ind. Eng."},{"key":"R12","unstructured":"Glover F.W. and Kochenberger G.A., Handbook of Metaheuristics. Vol 57, Springer Science & Business Media. Kluwer Academic Publishers. New York, Boston, Dordrecht, London, Moscow (2006)."},{"key":"R13","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":"R14","unstructured":"Guo P., Chen W. and Wang Y., A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs. Preprint arXiv: 1301.7134 (2013)."},{"key":"R15","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":"R16","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1023\/A:1011336210885","volume":"7","author":"Hansen","year":"2001","journal-title":"J. Heuristics"},{"key":"R17","unstructured":"Helsgaun K., An effective implementation of K-opt moves for the Lin-Kernighan TSP heuristic. Ph.D. thesis, Roskilde University, Department of Computer Science (2006)."},{"key":"R18","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/j.ejor.2010.02.022","volume":"206","author":"Ili\u0107","year":"2010","journal-title":"Eur. J. Oper. Res."},{"key":"R19","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":"R20","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":"R21","unstructured":"Krim H., Benmansour R. and Duvivier D., Minimizing the weighted completion time on a single machine with periodic maintenance. In: ROADEF 2016, Compi\u00e9gne, France (Februrary 2016)."},{"key":"R22","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/BF01178778","volume":"29","author":"Lee","year":"1992","journal-title":"Acta Info."},{"key":"R23","doi-asserted-by":"crossref","first-page":"2196","DOI":"10.1016\/j.cor.2011.11.002","volume":"39","author":"Lee","year":"2012","journal-title":"Comput. Oper. Res."},{"key":"R24","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s11750-011-0188-6","volume":"20","author":"Lei","year":"2012","journal-title":"TOP"},{"key":"R25","doi-asserted-by":"crossref","first-page":"1335","DOI":"10.1016\/S0305-0548(02)00074-6","volume":"30","author":"Liao","year":"2003","journal-title":"Comput. Oper. Res."},{"key":"R26","doi-asserted-by":"crossref","first-page":"6429","DOI":"10.1016\/j.eswa.2010.02.075","volume":"37","author":"Low","year":"2010","journal-title":"Expert Syst. Appl."},{"key":"R27","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.omega.2016.06.008","volume":"68","author":"Luo","year":"2017","journal-title":"Omega"},{"key":"R28","first-page":"615","volume":"24","author":"Mjirda","year":"2017","journal-title":"ITOR"},{"key":"R29","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"Mladenovi\u0107","year":"1997","journal-title":"Comput. Oper. Res."},{"key":"R30","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1287\/opre.33.3.562","volume":"33","author":"Posner","year":"1985","journal-title":"Oper. Res."},{"key":"R31","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.ijpe.2010.11.004","volume":"143","author":"Roux","year":"2013","journal-title":"Int. J. Prod. Econ."},{"key":"R32","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"Smith","year":"1956","journal-title":"Nav. Res. Log. Q."},{"key":"R33","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1016\/j.cie.2016.11.009","volume":"103","author":"Su","year":"2017","journal-title":"Comput. Ind. Eng."},{"key":"R34","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/j.ejor.2016.01.014","volume":"252","author":"Todosijevic","year":"2016","journal-title":"Eur. J. Oper. Res."},{"key":"R35","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.cie.2017.02.019","volume":"107","author":"Yazdani","year":"2017","journal-title":"Comput. Ind. Eng."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2018055\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,28]],"date-time":"2020-08-28T18:58:41Z","timestamp":1598641121000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2018055"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":35,"journal-issue":{"issue":"1"},"alternative-id":["ro170170"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2018055","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1]]}}}