{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T14:22:50Z","timestamp":1776781370893,"version":"3.51.2"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,7,16]],"date-time":"2015-07-16T00:00:00Z","timestamp":1437004800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"CONSEIL REGIONAL DE LORRAINE"},{"name":"CONSEIL REGIONAL DE LORRAINE"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s10878-015-9924-4","type":"journal-article","created":{"date-parts":[[2015,7,15]],"date-time":"2015-07-15T01:14:42Z","timestamp":1436922882000},"page":"970-981","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval"],"prefix":"10.1007","volume":"32","author":[{"given":"Imed","family":"Kacem","sequence":"first","affiliation":[]},{"given":"Hans","family":"Kellerer","sequence":"additional","affiliation":[]},{"given":"Maryam","family":"Seifaddini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,16]]},"reference":[{"key":"9924_CR1","doi-asserted-by":"crossref","unstructured":"Brauner N, Finke G, Kellerer H, Lebacque V, Rapine C, Potts C, Strusevich V (2009) Operator non-availability periods. 4OR 7:239\u2013253","DOI":"10.1007\/s10288-008-0084-6"},{"key":"9924_CR2","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/S0377-2217(82)80007-6","volume":"11","author":"J Carlier","year":"1982","unstructured":"Carlier J (1982) The one-machine sequencing problem. Eur J Oper Res 11:42\u201347","journal-title":"Eur J Oper Res"},{"key":"9924_CR3","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/j.ins.2013.07.003","volume":"251","author":"Y Chen","year":"2013","unstructured":"Chen Y, Zhang A, Tan Z (2013) Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time. Inf Sci 251:150\u2013163","journal-title":"Inf Sci"},{"issue":"3","key":"9924_CR4","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1080\/05695557208974852","volume":"4","author":"MI Dessouky","year":"1972","unstructured":"Dessouky MI, Margenthaler CR (1972) The one-machine sequencing problem with early starts and due dates. AIIE Trans 4(3):214\u2013222","journal-title":"AIIE Trans"},{"key":"9924_CR5","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0166-218X(81)90008-1","volume":"3","author":"GV Gens","year":"1981","unstructured":"Gens GV, Levner EV (1981) Fast approximation algorithms for job sequencing with deadlines. Discret Appl Math 3:313\u2013318","journal-title":"Discret Appl Math"},{"key":"9924_CR6","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/j.tcs.2006.04.014","volume":"363","author":"Y He","year":"2006","unstructured":"He Y, Zhong W, Gu H (2006) Improved algorithms for two single machine scheduling problems. Theor Comput Sci 363:257\u2013265","journal-title":"Theor Comput Sci"},{"key":"9924_CR7","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"O Ibarra","year":"1975","unstructured":"Ibarra O, Kim CE (1975) Fast approximation algorithms for the knapsack and sum of subset problems. J ACM 22:463\u2013468","journal-title":"J ACM"},{"issue":"2","key":"9924_CR8","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":"1","key":"9924_CR9","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.dam.2011.07.005","volume":"164","author":"I Kacem","year":"2014","unstructured":"Kacem I, Kellerer H (2014) Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times. Discret Appl Math 164(1):154\u2013160","journal-title":"Discret Appl Math"},{"key":"9924_CR10","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1287\/opre.1060.0301","volume":"54","author":"MA Kubzin","year":"2006","unstructured":"Kubzin MA, Strusevich VA (2006) Planning machine maintenance in two machine shop scheduling. Oper Res 54:789\u2013800","journal-title":"Oper Res"},{"key":"9924_CR11","first-page":"363","volume":"9","author":"CY Lee","year":"1996","unstructured":"Lee CY (1996) Machine scheduling with an availability constraints. J Glob Optim 9:363\u2013384","journal-title":"J Glob Optim"},{"key":"9924_CR12","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1016\/j.dam.2006.06.005","volume":"155","author":"X Qi","year":"2007","unstructured":"Qi X (2007) A note on worst-case performance of heuristics for maintenance scheduling problems. Discret Appl Math 155:416\u2013422","journal-title":"Discret Appl Math"},{"key":"9924_CR13","doi-asserted-by":"crossref","first-page":"1071","DOI":"10.1057\/palgrave.jors.2600791","volume":"50","author":"X Qi","year":"1999","unstructured":"Qi X, Chen T, Tu F (1999) Scheduling the maintenance on a single machine. J Oper Res Soc 50:1071\u20131078","journal-title":"J Oper Res Soc"},{"key":"9924_CR14","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10951-012-0269-x","volume":"15","author":"C Rapine","year":"2012","unstructured":"Rapine C, Brauner N, Finke G, Lebacque V (2012) Single machine scheduling with small operator-non-availability periods. J Sched 15:127\u2013139","journal-title":"J Sched"},{"key":"9924_CR15","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/321921.321934","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni S (1976) Algorithms for scheduling independent tasks. J ACM 23:116\u2013127","journal-title":"J ACM"},{"key":"9924_CR16","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 Oper Res 121:1\u201315","journal-title":"Eur J Oper Res"},{"issue":"3","key":"9924_CR17","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1142\/S0217595908001778","volume":"25","author":"JJ Yuan","year":"2008","unstructured":"Yuan JJ, Shi L, Ou JW (2008) Single machine scheduling with forbidden intervals and job delivery times. Asia-Pac J Oper Res 25(3):317\u2013325","journal-title":"Asia-Pac J Oper Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9924-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9924-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9924-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:27Z","timestamp":1559262207000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9924-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,16]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["9924"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9924-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,16]]}}}