{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T09:48:50Z","timestamp":1764841730584},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s10878-013-9643-7","type":"journal-article","created":{"date-parts":[[2013,7,16]],"date-time":"2013-07-16T04:42:59Z","timestamp":1373949779000},"page":"403-412","source":"Crossref","is-referenced-by-count":9,"title":["Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals"],"prefix":"10.1007","volume":"30","author":[{"given":"Imed","family":"Kacem","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"Kellerer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yann","family":"Lanuel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,7,17]]},"reference":[{"key":"9643_CR1","first-page":"31","volume":"16","author":"GV Gens","year":"1978","unstructured":"Gens GV, Levner EV (1978) Approximation algorithms for certain universal problems in scheduling theory. Eng Cybern 16:31\u201336","journal-title":"Eng Cybern"},{"key":"9643_CR2","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. Discrete Appl Math 3:313\u2013318","journal-title":"Discrete Appl Math"},{"key":"9643_CR3","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:257\u2013265","journal-title":"J Sched"},{"key":"9643_CR4","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/j.tcs.2006.08.030","volume":"369","author":"H Kellerer","year":"2006","unstructured":"Kellerer H, Strusevich VA (2006) A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date. Theoret Comput Sci 369:230\u2013238","journal-title":"Theoret Comput Sci"},{"key":"9643_CR5","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1287\/mnsc.16.1.77","volume":"16","author":"EL Lawler","year":"1969","unstructured":"Lawler EL, Moore JM (1969) A functional equation and its application to resource scheduling and sequencing problems. Manage Sci 16:77\u201384","journal-title":"Manage Sci"},{"key":"9643_CR6","first-page":"363","volume":"9","author":"C-Y Lee","year":"1996","unstructured":"Lee C-Y (1996) Machine scheduling with an availability constraint. J Global Optim 9:363\u2013382","journal-title":"J Global Optim"},{"key":"9643_CR7","first-page":"22-1","volume-title":"Handbook of scheduling: algorithms, models and performance analysis","author":"C-Y Lee","year":"2004","unstructured":"Lee C-Y (2004) Machine scheduling with availability constraints. In: Leung JY-T (ed) Handbook of scheduling: algorithms, models and performance analysis. Chapman & Hall\/CRC, London, pp 22-1\u201322-13"},{"key":"9643_CR8","doi-asserted-by":"crossref","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 (2010) A survey of scheduling with deterministic machine availability constraints. Comput Ind Eng 58:199\u2013211","journal-title":"Comput Ind Eng"},{"key":"9643_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-2361-4","volume-title":"Scheduling: theory, algorithms and systems","author":"M Pinedo","year":"2012","unstructured":"Pinedo M (2012) Scheduling: theory, algorithms and systems, 4th edn. Springer, New York","edition":"4"},{"key":"9643_CR10","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0167-6377(92)90001-J","volume":"11","author":"CN Potts","year":"1992","unstructured":"Potts CN, van Wassenhove LN (1992) Approximation algorithms for scheduling a single machine to minimize total late work. Oper Res Lett 11:261\u2013266","journal-title":"Oper Res Lett"},{"key":"9643_CR11","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 Assoc Comput Mach 23:116\u2013127","journal-title":"J Assoc Comput Mach"},{"key":"9643_CR12","doi-asserted-by":"crossref","first-page":"920","DOI":"10.1287\/opre.25.6.920","volume":"25","author":"S Sahni","year":"1977","unstructured":"Sahni S (1977) General techniques for combinatorial approximation. Oper Res 25:920\u2013936","journal-title":"Oper Res"},{"key":"9643_CR13","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"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9643-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9643-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9643-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:21Z","timestamp":1559262201000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9643-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,17]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["9643"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9643-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7,17]]}}}