{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T14:27:17Z","timestamp":1771943237062,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,12,18]],"date-time":"2012-12-18T00:00:00Z","timestamp":1355788800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s12351-012-0130-1","type":"journal-article","created":{"date-parts":[[2012,12,17]],"date-time":"2012-12-17T05:38:32Z","timestamp":1355722712000},"page":"363-383","source":"Crossref","is-referenced-by-count":16,"title":["Scheduling jobs and maintenance activities on parallel machines"],"prefix":"10.1007","volume":"13","author":[{"given":"Maher","family":"Rebai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Imed","family":"Kacem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kondo H.","family":"Adjallah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,12,18]]},"reference":[{"key":"130_CR1","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1016\/j.ejor.2006.06.032","volume":"181","author":"EH Aghezzaf","year":"2007","unstructured":"Aghezzaf EH, Jamali MA, Ait-Kadi D (2007) An integrated production and preventive maintenance planning model. Eur J Operat Res 181:679\u2013685","journal-title":"Eur J Oper Res"},{"key":"130_CR3","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1287\/mnsc.11.2.268","volume":"11","author":"WL Eastman","year":"1964","unstructured":"Eastman WL, Even S, Isaacs IM (1964) Bounds for optimal scheduling of n jobs on m processors. Manag Sci 11:268\u2013279","journal-title":"Manag Sci"},{"key":"130_CR4","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1002\/(SICI)1520-6750(199910)46:7<845::AID-NAV6>3.0.CO;2-#","volume":"46","author":"HG Graves","year":"1999","unstructured":"Graves HG, Lee C-Y (1999) Scheduling maintenance and semiresumable jobs on a single machine. Naval Res Logist 46:845\u2013863","journal-title":"Naval Res Logist"},{"issue":"2","key":"130_CR5","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s10878-007-9102-4","volume":"17","author":"I Kacem","year":"2009","unstructured":"Kacem I (2009) Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval. J Comb Optim 17(2):117\u2013133","journal-title":"J Comb Optim"},{"issue":"3","key":"130_CR6","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/j.cie.2007.08.005","volume":"54","author":"I Kacem","year":"2008","unstructured":"Kacem I (2008) Approximation algorithm for the weighted flowtime minimization on a single machine with a fixed non-availability interval. Comput Ind Eng 54(3):401\u2013410","journal-title":"Comput Ind Eng"},{"issue":"3","key":"130_CR7","doi-asserted-by":"crossref","first-page":"1080","DOI":"10.1016\/j.ejor.2006.06.062","volume":"187","author":"I Kacem","year":"2008","unstructured":"Kacem I, Chu C (2008) Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period. Eur J Operat Res 187(3):1080-1089","journal-title":"Eur J Oper Res"},{"issue":"4","key":"130_CR8","doi-asserted-by":"crossref","first-page":"1708","DOI":"10.1016\/j.cie.2008.09.042","volume":"56","author":"I Kacem","year":"2009","unstructured":"Kacem I, Mahjoub RA (2009) Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval. Comput Ind Eng 56(4):1708\u20131712","journal-title":"Comput Ind Eng"},{"key":"130_CR9","doi-asserted-by":"crossref","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 (2008) Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times. Comput Operat Res 35:827\u2013844","journal-title":"Comput Operat Res"},{"issue":"1","key":"130_CR10","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10288-008-0076-6","volume":"7","author":"I Kacem","year":"2009","unstructured":"Kacem I, Haouari M (2009) Approximation algorithms for single machine scheduling with one unavailability period. 4OR Quart J Operat Res 7(1):79\u201392","journal-title":"4OR Quart J Operat Res"},{"issue":"3","key":"130_CR11","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s10951-009-0146-4","volume":"14","author":"I Kacem","year":"2011","unstructured":"Kacem I, Kellerer H (2011) Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates. J Sched 14(3):257\u2013265","journal-title":"J Sched"},{"issue":"1\/2","key":"130_CR12","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1504\/IJPS.2011.044560","volume":"1","author":"I Kacem","year":"2011","unstructured":"Kacem I, Lanuel Y, Sahnoune M (2011) Strongly Fully Polynomial Time Approximation Scheme for the Two-Parallel Capacitated Machines Scheduling Problem. International Journal of Planning and Sched 1(1\/2):32\u201341","journal-title":"Int J Plan Schedul"},{"key":"130_CR13","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.ejor.2008.11.003","volume":"199","author":"H Kellerer","year":"2009","unstructured":"Kellerer H, Kubzin MA, Strusevich VA (2009) Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval. Eur J Operat Res 199:111\u2013116","journal-title":"Eur J Oper Res"},{"key":"130_CR14","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1016\/S0377-2217(01)00083-2","volume":"136","author":"W Kubiak","year":"2002","unstructured":"Kubiak W, Blazewicz J, Formanowicz P, Breit J, (2002) Schmidt G Two-machine flow shops with limited machine availability. Eur J Operat Res 136:528\u2013540","journal-title":"Eur J Oper Res"},{"key":"130_CR15","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0167-6377(96)00041-7","volume":"20","author":"C-Y Lee","year":"2000","unstructured":"Lee C-Y (2000) Minimizing the makespan in the two machine scheduling scheduling problem with an availability constraint. Operat Res Lett 20:129\u2013139","journal-title":"Operat Res Lett"},{"key":"130_CR16","doi-asserted-by":"crossref","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. Naval Res Logist 47:145\u2013165","journal-title":"Naval Res Logist"},{"key":"130_CR17","first-page":"546","volume":"26","author":"G Li","year":"1997","unstructured":"Li G (1997) Single machine earliness and tardiness scheduling. Eur J Operat Res 26:546\u2013558","journal-title":"Eur J Oper Res"},{"key":"130_CR18","doi-asserted-by":"crossref","first-page":"1150","DOI":"10.1016\/j.ejor.2008.03.043","volume":"197","author":"R Mellouli","year":"2009","unstructured":"Mellouli R, Cherif S, Chu C, Kacem I (2009) Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times. Eur J Operat Res 197:1150\u20131167","journal-title":"Eur J Oper Res"},{"issue":"2","key":"130_CR20","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/opre.33.2.363","volume":"33","author":"CN Potts","year":"1985","unstructured":"Potts CN, van Wassenhove LN (1985) A branch and bound algorithm for the total weighted tardiness problem. Operat Res 33(2):363\u2013377","journal-title":"Operat Res"},{"issue":"4","key":"130_CR19","doi-asserted-by":"crossref","first-page":"1207","DOI":"10.1007\/s10845-010-0425-0","volume":"23","author":"M Rebai","year":"2012","unstructured":"Rebai M, Kacem I, Adjallah KH (2012) Earliness\u2013tardiness minimization on a single machine to schedule preventive maintenance tasks: metaheuristic and exact methods. J Intell Manuf 23(4):1207\u20131224","journal-title":"J Intell Manuf"},{"key":"130_CR21","doi-asserted-by":"crossref","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, Blazewicz J, Formanowicz P (2005) An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints. Eur J Operat Res 161:3\u201310","journal-title":"Eur J Oper Res"},{"key":"130_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(98)00367-1","volume":"121","author":"G Schmidt","year":"2000","unstructured":"Schmidt G (2000) Scheduling with limited machine availability. Eur J Operat Res 121:1\u201315","journal-title":"Eur J Oper Res"},{"key":"130_CR23","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"WE Smith","year":"1956","unstructured":"Smith WE (1956) Various optimizers for single-stage production. Naval Res Logist Quart 3:59\u201366","journal-title":"Naval Res Logist Quart"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-012-0130-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12351-012-0130-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-012-0130-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T04:04:35Z","timestamp":1559448275000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12351-012-0130-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,18]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["130"],"URL":"https:\/\/doi.org\/10.1007\/s12351-012-0130-1","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12,18]]}}}