{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T04:48:40Z","timestamp":1771476520410,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,10,15]],"date-time":"2019-10-15T00:00:00Z","timestamp":1571097600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,15]],"date-time":"2019-10-15T00:00:00Z","timestamp":1571097600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"ELSAT 2020"},{"name":"LIA-ROI-TML"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s10589-019-00142-5","type":"journal-article","created":{"date-parts":[[2019,10,15]],"date-time":"2019-10-15T12:50:38Z","timestamp":1571143838000},"page":"291-320","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance"],"prefix":"10.1007","volume":"75","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":"Daoud","family":"A\u00eft-Kadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Said","family":"Hanafi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,15]]},"reference":[{"issue":"4","key":"142_CR1","doi-asserted-by":"publisher","first-page":"2041","DOI":"10.1016\/j.apm.2010.11.017","volume":"35","author":"F \u00c1ngel-Bello","year":"2011","unstructured":"\u00c1ngel-Bello, F., \u00c1lvarez, A., Pacheco, J., Mart\u00ednez, I.: A single machine scheduling problem with availability constraints and sequence-dependent setup costs. Appl. Math. Model. 35(4), 2041\u20132050 (2011)","journal-title":"Appl. Math. Model."},{"key":"142_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-472-0","volume-title":"Handbook of Maintenance Management and Engineering","author":"M Ben-Daya","year":"2009","unstructured":"Ben-Daya, M., Ait-Kadi, D., Duffuaa, S.O., Knezevic, J., Raouf, A.: Handbook of Maintenance Management and Engineering, vol. 7. Springer, Berlin (2009)"},{"key":"142_CR3","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.cor.2014.02.004","volume":"47","author":"R Benmansour","year":"2014","unstructured":"Benmansour, R., Allaoui, H., Artiba, A., Hanafi, S.: Minimizing the weighted sum of maximum earliness and maximum tardiness costs on a single machine with periodic preventive maintenance. Comput. Oper. Res. 47, 106\u2013113 (2014)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"142_CR4","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1108\/13552511111157371","volume":"17","author":"R Benmansour","year":"2011","unstructured":"Benmansour, R., Allaoui, H., Artiba, A., Iassinovski, S., Pellerin, R.: Simulation-based approach to joint production and preventive maintenance scheduling on a failure-prone machine. J. Qual. Maint. Eng. 17(3), 254\u2013267 (2011)","journal-title":"J. Qual. Maint. Eng."},{"key":"142_CR5","unstructured":"Benmansour, R., Artiba, A., Duvivier, D., Ramat, E., Ait-Kadi, D.: Scheduling of production and maintenance activities under reliability constraint. In: 9th International Conference on Modeling, Optimization & Simulation (2012)"},{"issue":"4","key":"142_CR6","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1057\/palgrave.jors.2601998","volume":"57","author":"W Chen","year":"2006","unstructured":"Chen, W.: Minimizing total flow time in the single-machine scheduling problem with periodic maintenance. J. Oper. Res. Soc. 57(4), 410\u2013415 (2006)","journal-title":"J. Oper. Res. Soc."},{"issue":"11\u201312","key":"142_CR7","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1007\/s00170-006-0689-x","volume":"34","author":"WJ Chen","year":"2007","unstructured":"Chen, W.J.: An efficient algorithm for scheduling jobs on a machine with periodic maintenance. Int. J. Adv. Manuf. Technol. 34(11\u201312), 1173\u20131182 (2007)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"2","key":"142_CR8","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s11766-011-2488-x","volume":"26","author":"Y Chen","year":"2011","unstructured":"Chen, Y., Zhang, A., Tan, Z.Y.: Single machine scheduling with semi-resumable machine availability constraints. Appl. Math. J. Chin. Univ. 26(2), 177\u2013186 (2011)","journal-title":"Appl. Math. J. Chin. Univ."},{"key":"142_CR9","first-page":"11","volume":"2013","author":"A Ebrahimy Zade","year":"2013","unstructured":"Ebrahimy Zade, A., Fakhrzad, M.B.: A dynamic genetic algorithm for solving a single machine scheduling problem with periodic maintenance. ISRN Ind. Eng. 2013, 11 (2013)","journal-title":"ISRN Ind. Eng."},{"key":"142_CR10","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco (1979)"},{"key":"142_CR11","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Kan, A.R.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Discrete Math."},{"key":"142_CR12","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.cor.2016.01.021","volume":"72","author":"J He","year":"2016","unstructured":"He, J., Li, Q., Xu, D.: Scheduling two parallel machines with machine-dependent availabilities. Comput. Oper. Res. 72, 31\u201342 (2016)","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"142_CR13","doi-asserted-by":"publisher","first-page":"1764","DOI":"10.1016\/j.cor.2005.05.034","volume":"34","author":"M Ji","year":"2007","unstructured":"Ji, M., He, Y., Cheng, T.E.: Single-machine scheduling with periodic maintenance to minimize makespan. Comput. Oper. Res. 34(6), 1764\u20131770 (2007)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"142_CR14","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1080\/09511920701575088","volume":"21","author":"I Kacem","year":"2008","unstructured":"Kacem, I., Chu, C.: Minimizing the weighted flow time on a single machine with the resumable availability constraint: worst case of the WSPT heuristic. Int. J. Comput. Integr. Manuf. 21(4), 388\u2013395 (2008)","journal-title":"Int. J. Comput. Integr. Manuf."},{"issue":"3","key":"142_CR15","doi-asserted-by":"publisher","first-page":"1080","DOI":"10.1016\/j.ejor.2006.06.062","volume":"187","author":"I Kacem","year":"2008","unstructured":"Kacem, I., Chu, C.: Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period. Eur. J. Oper. Res. 187(3), 1080\u20131089 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"142_CR16","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1016\/j.cor.2006.04.010","volume":"35","author":"I Kacem","year":"2008","unstructured":"Kacem, I., Chu, C., Souissi, A.: Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times. Comput. Oper. Res. 35(3), 827\u2013844 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"142_CR17","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.disopt.2012.11.002","volume":"10","author":"I Kacem","year":"2013","unstructured":"Kacem, I., Paschos, V.T.: Weighted completion time minimization on a single-machine with a fixed non-availability interval: differential approximability. Discrete Optim. 10(1), 61\u201368 (2013)","journal-title":"Discrete Optim."},{"issue":"4","key":"142_CR18","first-page":"363","volume":"6","author":"L Kantorovich","year":"1939","unstructured":"Kantorovich, L.: The mathematical method of production planning and organization. Manag. Sci. 6(4), 363\u2013422 (1939)","journal-title":"Manag. Sci."},{"issue":"3\u20134","key":"142_CR19","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/BF00121681","volume":"9","author":"CY Lee","year":"1996","unstructured":"Lee, C.Y.: Machine scheduling with an availability constraint. J. Global Optim. 9(3\u20134), 395\u2013416 (1996)","journal-title":"J. Global Optim."},{"issue":"4","key":"142_CR20","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/BF01178778","volume":"29","author":"CY Lee","year":"1992","unstructured":"Lee, C.Y., Liman, S.D.: Single machine flow-time scheduling with scheduled maintenance. Acta Inform. 29(4), 375\u2013382 (1992)","journal-title":"Acta Inform."},{"issue":"9","key":"142_CR21","doi-asserted-by":"publisher","first-page":"2196","DOI":"10.1016\/j.cor.2011.11.002","volume":"39","author":"JY Lee","year":"2012","unstructured":"Lee, J.Y., Kim, Y.D.: Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance. Comput. Oper. Res. 39(9), 2196\u20132205 (2012)","journal-title":"Comput. Oper. Res."},{"key":"142_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ijpe.2017.01.014","volume":"186","author":"G Li","year":"2017","unstructured":"Li, G., Liu, M., Sethi, S.P., Xu, D.: Parallel-machine scheduling with machine-dependent maintenance periodic recycles. Int. J. Prod. Econ. 186, 1\u20137 (2017)","journal-title":"Int. J. Prod. Econ."},{"issue":"9","key":"142_CR23","doi-asserted-by":"publisher","first-page":"1335","DOI":"10.1016\/S0305-0548(02)00074-6","volume":"30","author":"C Liao","year":"2003","unstructured":"Liao, C., Chen, W.: Single-machine scheduling with periodic maintenance and nonresumable jobs. Comput. Oper. Res. 30(9), 1335\u20131347 (2003)","journal-title":"Comput. Oper. Res."},{"issue":"9","key":"142_CR24","doi-asserted-by":"publisher","first-page":"6429","DOI":"10.1016\/j.eswa.2010.02.075","volume":"37","author":"C Low","year":"2010","unstructured":"Low, C., Hsu, C.J., Su, C.T.: A modified particle swarm optimization algorithm for a single-machine scheduling problem with periodic maintenance. Expert Syst. Appl. 37(9), 6429\u20136434 (2010)","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"142_CR25","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.cie.2009.04.014","volume":"58","author":"Y Ma","year":"2010","unstructured":"Ma, Y., Chu, C., Zuo, C.: A survey of scheduling with deterministic machine availability constraints. Comput. Ind. Eng. 58(2), 199\u2013211 (2010)","journal-title":"Comput. Ind. Eng."},{"key":"142_CR26","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/j.ejor.2017.10.020","volume":"266","author":"V Nesello","year":"2017","unstructured":"Nesello, V., Subramanian, A., Battarra, M., Laporte, G.: Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times. Eur. J. Oper. Res. 266, 498\u2013507 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"142_CR27","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1057\/palgrave.jors.2600791","volume":"50","author":"X Qi","year":"1999","unstructured":"Qi, X., Chen, T., Tu, F.: Scheduling the maintenance on a single machine. J. Oper. Res. Soc. 50, 1071\u20131078 (1999)","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"142_CR28","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.ijpe.2010.11.004","volume":"143","author":"O Roux","year":"2013","unstructured":"Roux, O., Duvivier, D., Quesnel, G., Ramat, E.: Optimization of preventive maintenance through a combined maintenance-production simulation model. Int. J. Prod. Econ. 143(1), 3\u201312 (2013)","journal-title":"Int. J. Prod. Econ."},{"key":"142_CR29","doi-asserted-by":"crossref","unstructured":"Sadfi, C., Kacem, I., Liu, W.: Lower bounds for total weighted completion scheduling problem with availability constraints. In: Computers & Industrial Engineering, CIE 2009, pp. 159\u2013163. IEEE (2009)","DOI":"10.1109\/ICCIE.2009.5223882"},{"key":"142_CR30","unstructured":"Sadfi, C., Penz, B., Rapine, C.: A dynamic programming algorithm for the single machine total completion time scheduling problem with availability constraints. In: Eighth International Workshop on Project Management and Scheduling, Valence, Spain (2002)"},{"issue":"1","key":"142_CR31","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.ejor.2003.08.026","volume":"161","author":"C Sadfi","year":"2005","unstructured":"Sadfi, C., Penz, B., Rapine, C., B\u0142a\u017cewicz, J., Formanowicz, P.: An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints. Eur. J. Oper. Res. 161(1), 3\u201310 (2005)","journal-title":"Eur. J. Oper. Res."},{"issue":"1\u20132","key":"142_CR32","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"WE Smith","year":"1956","unstructured":"Smith, W.E.: Various optimizers for single-stage production. Nav. Res. Logist. Q. 3(1\u20132), 59\u201366 (1956). \nhttps:\/\/doi.org\/10.1002\/nav.3800030106","journal-title":"Nav. Res. Logist. Q."},{"issue":"1\u20134","key":"142_CR33","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10479-004-5032-z","volume":"133","author":"G Wang","year":"2005","unstructured":"Wang, G., Sun, H., Chu, C.: Preemptive scheduling with availability constraints to minimize total weighted completion times. Ann. Oper. Res. 133(1\u20134), 183\u2013192 (2005)","journal-title":"Ann. Oper. Res."},{"issue":"14","key":"142_CR34","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.: 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 (2013)","journal-title":"Appl. Math. Model."},{"issue":"4","key":"142_CR35","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1016\/j.cor.2010.09.003","volume":"38","author":"SL Yang","year":"2011","unstructured":"Yang, S.L., Ma, Y., Xu, D.L., Yang, J.B.: Minimizing total completion time on a single machine with a flexible maintenance activity. Comput. Oper. Res. 38(4), 755\u2013770 (2011)","journal-title":"Comput. Oper. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00142-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00142-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00142-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,13]],"date-time":"2020-10-13T23:20:08Z","timestamp":1602631208000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00142-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,15]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["142"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00142-5","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,15]]},"assertion":[{"value":"26 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}