{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:40:15Z","timestamp":1767138015405,"version":"build-2238731810"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319091730","type":"print"},{"value":"9783319091747","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09174-7_26","type":"book-chapter","created":{"date-parts":[[2014,7,21]],"date-time":"2014-07-21T01:42:05Z","timestamp":1405906925000},"page":"305-314","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"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","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":[[2014,7,22]]},"reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10288-008-0084-6","volume":"7","author":"N Brauner","year":"2009","unstructured":"Brauner, N., Finke, G., Kellerer, H., Lebacque, V., Rapine, C., Potts, C., Strusevich, V.: Operator non-availability periods. 4 OR-Q. J. Oper. Res. 7, 239\u2013253 (2009)","journal-title":"4 OR-Q. J. Oper. Res."},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/S0377-2217(82)80007-6","volume":"11","author":"J Carlier","year":"1982","unstructured":"Carlier, J.: The one-machine sequencing problem. Eur. J. Oper. Res. 11, 42\u201347 (1982)","journal-title":"Eur. J. Oper. Res."},{"key":"26_CR3","doi-asserted-by":"publisher","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.: Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time. Inf. Sci. 251, 150\u2013163 (2013)","journal-title":"Inf. Sci."},{"issue":"3","key":"26_CR4","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1080\/05695557208974852","volume":"4","author":"MI Dessouky","year":"1972","unstructured":"Dessouky, M.I., Margenthaler, C.R.: The one-machine sequencing problem with early starts and due dates. AIIE Trans. 4(3), 214\u2013222 (1972)","journal-title":"AIIE Trans."},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0166-218X(81)90008-1","volume":"3","author":"GV Gens","year":"1981","unstructured":"Gens, G.V., Levner, E.V.: Fast approximation algorithms for job sequencing with deadlines. Discret. Appl. Math. 3, 313\u2013318 (1981)","journal-title":"Discret. Appl. Math."},{"key":"26_CR6","doi-asserted-by":"publisher","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.: Improved algorithms for two single machine scheduling problems. Theor. Comput. Sci. 363, 257\u2013265 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"O Ibarra","year":"1975","unstructured":"Ibarra, O., Kim, C.E.: Fast approximation algorithms for the knapsack and sum of subset problems. J. ACM 22, 463\u2013468 (1975)","journal-title":"J. ACM"},{"issue":"2","key":"26_CR8","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s10878-007-9102-4","volume":"17","author":"I Kacem","year":"2009","unstructured":"Kacem, I.: 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 (2009)","journal-title":"J. Comb. Optim."},{"key":"26_CR9","doi-asserted-by":"publisher","unstructured":"Kacem, I., Kellerer, H.: Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times. Discret. Appl. Math. 2011 (2010). doi:10.1016\/j.dam.2011.07.005","DOI":"10.1016\/j.dam.2011.07.005"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1287\/opre.1060.0301","volume":"54","author":"MA Kubzin","year":"2006","unstructured":"Kubzin, M.A., Strusevich, V.A.: Planning machine maintenance in two machine shop scheduling. Oper. Res. 54, 789\u2013800 (2006)","journal-title":"Oper. Res."},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/BF00121681","volume":"9","author":"CY Lee","year":"1996","unstructured":"Lee, C.Y.: Machine scheduling with an availability constraints. J. Global Optim. 9, 363\u2013384 (1996)","journal-title":"J. Global Optim."},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1016\/j.dam.2006.06.005","volume":"155","author":"X Qi","year":"2007","unstructured":"Qi, X.: A note on worst-case performance of heuristics for maintenance scheduling problems. Discret. Appl. Math. 155, 416\u2013422 (2007)","journal-title":"Discret. Appl. Math."},{"key":"26_CR13","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."},{"key":"26_CR14","doi-asserted-by":"publisher","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.: Single machine scheduling with small operator-non-availability periods. J. Sched. 15, 127\u2013139 (2012)","journal-title":"J. Sched."},{"key":"26_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(98)00367-1","volume":"121","author":"G Schmidt","year":"2000","unstructured":"Schmidt, G.: Scheduling with limited machine availability. Eur. J. Oper. Res. 121, 1\u201315 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/321921.321934","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni, S.: Algorithms for scheduling independent tasks. J. ACM 23, 116\u2013127 (1976)","journal-title":"J. ACM"},{"issue":"3","key":"26_CR17","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1142\/S0217595908001778","volume":"25","author":"JJ Yuan","year":"2008","unstructured":"Yuan, J.J., Shi, L., Ou, J.W.: Single machine scheduling with forbidden intervals and job delivery times. Asia Pac. J. Oper. Res. 25(3), 317\u2013325 (2008)","journal-title":"Asia Pac. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09174-7_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T21:10:36Z","timestamp":1703193036000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-09174-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319091730","9783319091747"],"references-count":17,"aliases":["10.1007\/978-3-319-14115-2_26"],"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09174-7_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"22 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}