{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:54:41Z","timestamp":1725533681285},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642021572"},{"type":"electronic","value":"9783642021589"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02158-9_27","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T15:36:06Z","timestamp":1245252966000},"page":"315-325","source":"Crossref","is-referenced-by-count":1,"title":["On Job Scheduling with Preemption Penalties"],"prefix":"10.1007","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":"Chung Keung","family":"Poon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","volume-title":"Online computation and competitive analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-yaniv, R.: Online computation and competitive analysis. Cambridge University Press, Cambridge (1998)"},{"issue":"4","key":"27_CR2","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.ipl.2008.05.020","volume":"108","author":"S.P.Y. Fung","year":"2008","unstructured":"Fung, S.P.Y.: Lower bounds on online deadline scheduling with preemption penalties. Information Processing Letters\u00a0108(4), 214\u2013218 (2008)","journal-title":"Information Processing Letters"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/11560586_21","volume-title":"Theoretical Computer Science","author":"S.P.Y. Fung","year":"2005","unstructured":"Fung, S.P.Y., Chin, F.Y.L., Poon, C.K.: Laxity helps in broadcast scheduling. In: Coppo, M., Lodi, E., Pinna, G.M. (eds.) ICTCS 2005. LNCS, vol.\u00a03701, pp. 251\u2013264. Springer, Heidelberg (2005)"},{"issue":"2","key":"27_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1023\/A:1022994010777","volume":"6","author":"M.H. Goldwasser","year":"2003","unstructured":"Goldwasser, M.H.: Patience is a virtue: the effect of slack on competitiveness for admission control. Journal of Scheduling\u00a06(2), 183\u2013211 (2003)","journal-title":"Journal of Scheduling"},{"key":"27_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/3-540-45071-8_42","volume-title":"Computing and Combinatorics","author":"J.-H. Kim","year":"2003","unstructured":"Kim, J.-H., Chwa, K.-Y.: Scheduling broadcasts with deadlines. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol.\u00a02697, pp. 415\u2013424. Springer, Heidelberg (2003)"},{"key":"27_CR6","unstructured":"Liption, R., Tomkins, A.: Online interval scheduling. In: Proc. 5th ACM-SIAM Symposium on Discrete Algorithms, pp. 302\u2013311 (1994)"},{"volume-title":"Handbook of Applied Optimization","year":"2002","key":"27_CR7","unstructured":"Pardalos, P.M., Resende, M.G.C. (eds.): Handbook of Applied Optimization. Oxford University Press, Oxford (2002)"},{"key":"27_CR8","first-page":"15","volume-title":"Handbook of scheduling: algorithms, models and performance analysis","author":"K. Pruhs","year":"2004","unstructured":"Pruhs, K., Torng, E., Sgall, J.: Online scheduling. In: Leung, J.Y.T. (ed.) Handbook of scheduling: algorithms, models and performance analysis, vol.\u00a015, pp. 15\u20131\u201315\u201341. CRC Press, Boca Raton (2004)"},{"issue":"1-3","key":"27_CR9","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.tcs.2008.03.031","volume":"410","author":"H.F. Ting","year":"2008","unstructured":"Ting, H.F.: A near optimal scheduler for on-demand data broadcasts. Theoretical Computer Science\u00a0410(1-3), 77\u201384 (2008)","journal-title":"Theoretical Computer Science"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/11809678_34","volume-title":"Computing and Combinatorics","author":"F.F. Zheng","year":"2006","unstructured":"Zheng, F.F., Fung, S.P.Y., Chan, W.T., Chin, F.Y.L., Poon, C.K.: Improved on-line broadcast scheduling with deadlines. In: Chen, D.Z., Lee, D.T. (eds.) COCOON 2006. LNCS, vol.\u00a04112, pp. 320\u2013329. Springer, Heidelberg (2006)"},{"issue":"13","key":"27_CR11","first-page":"189","volume":"2","author":"F.F. Zheng","year":"2007","unstructured":"Zheng, F.F., Xu, Y.F., Zhang, E.: On-line production order scheduling with preemption penalties. Journal of Combinatorial Optimization\u00a02(13), 189\u2013204 (2007)","journal-title":"Journal of Combinatorial Optimization"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02158-9_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T22:03:30Z","timestamp":1552082610000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02158-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642021572","9783642021589"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02158-9_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}