{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:29:12Z","timestamp":1760707752530},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,12,8]],"date-time":"2006-12-08T00:00:00Z","timestamp":1165536000000},"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":[[2006,12,28]]},"DOI":"10.1007\/s10878-006-9027-3","type":"journal-article","created":{"date-parts":[[2006,12,7]],"date-time":"2006-12-07T11:37:37Z","timestamp":1165491457000},"page":"189-204","source":"Crossref","is-referenced-by-count":11,"title":["On-line production order scheduling with preemption penalties"],"prefix":"10.1007","volume":"13","author":[{"given":"Feifeng","family":"Zheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinfeng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,12,8]]},"reference":[{"key":"9027_CR1","volume-title":"Online computation and competitive analysis","author":"A Borodin","year":"1998","unstructured":"Borodin A, El-yaniv R (1998) Online computation and competitive analysis. Cambridge University Press, England"},{"key":"9027_CR2","doi-asserted-by":"crossref","unstructured":"Chan WT, Lam TW, Ting HF et al (2004) New results on on-demand broadcasting with deadline via job scheduling with cancellation. In: COCOON\u201904, LNCS 3106, Jeju, Korea, pp 210\u2013218","DOI":"10.1007\/978-3-540-27798-9_24"},{"key":"9027_CR3","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1109\/TAC.2004.825984","volume":"49","author":"CFM Chou","year":"2004","unstructured":"Chou CFM (2004) Asymptotic performance ratio of an online algorithm for the single machine scheduling with release dates. IEEE Trans Autom Contr 49:772\u2013776","journal-title":"IEEE Trans Autom Contr"},{"key":"9027_CR4","doi-asserted-by":"crossref","unstructured":"Chrobak M, Jawor W, Sgall J, Tichy T (2004) Online scheduling of equal-length jobs: randomization and restarts help. In: 31st International Colloquium on Automata Languages and Programming (ICALP 2004), LNCS 3142, Turku, Finland, pp 358\u2013370","DOI":"10.1007\/978-3-540-27836-8_32"},{"key":"9027_CR5","doi-asserted-by":"crossref","unstructured":"Fung SPY, Chin FYL, Poon CK (2005) Laxity helps in broadcast scheduling. In: Proceedings of 9th Italian Conference on Theoretical Computer Science, LNCS 3701, Siena, Italy, pp 251\u2013264","DOI":"10.1007\/11560586_21"},{"key":"9027_CR6","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0167-6377(00)00061-4","volume":"27","author":"H Hoogeveen","year":"2000","unstructured":"Hoogeveen H, Potts CN, Woeginger GJ (2000) On-line scheduling on a single machine: maximizing the number of early jobs. Oper Res Lett 27:193\u2013196","journal-title":"Oper Res Lett"},{"key":"9027_CR7","first-page":"359","volume":"29","author":"FO Julien","year":"1997","unstructured":"Julien FO, Magazine MJ, Hall NG (1997) Generalized preemption models for single-machine dynamic scheduling problems. IIE Trans 29:359\u2013372","journal-title":"IIE Trans"},{"key":"9027_CR8","doi-asserted-by":"crossref","unstructured":"Kim JH, Chwa KY (2003) Scheduling broadcasts with deadlines. In: COCOON\u201903, LNCS 2697, Big Sky, MT, USA, pp 415\u2013424","DOI":"10.1007\/3-540-45071-8_42"},{"key":"9027_CR9","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/s10878-005-6854-6","volume":"9","author":"TW Lam","year":"2005","unstructured":"Lam TW, Ngan TW, To KK (2005) A tighter extra-resource analysis of online deadline scheduling. J Combin Optim 9:157\u2013165","journal-title":"J Combin Optim"},{"key":"9027_CR10","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1023\/B:JOSH.0000031424.35504.c4","volume":"7","author":"ZH Liu","year":"2004","unstructured":"Liu ZH, Cheng TCE (2004) Minimizing total completion time subject to job release dates and preemption penalties. J Sched 7:313\u2013327","journal-title":"J Sched"},{"key":"9027_CR11","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1002\/jos.93","volume":"5","author":"AS Schulz","year":"2002","unstructured":"Schulz AS, Skutella M (2002) The power of \u03b1-points in preemptive single machine scheudling. J Sched 5:121\u2013133","journal-title":"J Sched"},{"key":"9027_CR12","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 Log Quart 3:59\u201366","journal-title":"Naval Res Log Quart"},{"key":"9027_CR13","doi-asserted-by":"crossref","unstructured":"Ting HF (2006) A near optimal scheduler for on-demand data broadcasts. 6th Italian Conference on Algorithms and Complexity, LNCS 3998, Rome, Italy, pp 163\u2013174","DOI":"10.1007\/11758471_18"},{"key":"9027_CR14","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0304-3975(94)90150-3","volume":"130","author":"GJ Woeginger","year":"1994","unstructured":"Woeginger GJ (1994) On-line scheduling of jobs with fixed start and end times. Theor Computer Sci 130:5\u201316","journal-title":"Theor Computer Sci"},{"key":"9027_CR15","doi-asserted-by":"crossref","unstructured":"Zheng FF, Fung SPY, Chan WT, Chin FYL, Poon CK, Wong PWH (2006) Improved on-line broadcast scheduling with deadlines. In: COCOON\u201906, LNCS 4112, Taipei, Taiwan, pp 320\u2013329","DOI":"10.1007\/11809678_34"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-9027-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-006-9027-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-9027-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:18:10Z","timestamp":1559261890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-006-9027-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12,8]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,12,28]]}},"alternative-id":["9027"],"URL":"https:\/\/doi.org\/10.1007\/s10878-006-9027-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12,8]]}}}