{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:12:10Z","timestamp":1763467930056},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,5,9]],"date-time":"2009-05-09T00:00:00Z","timestamp":1241827200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s00453-009-9321-4","type":"journal-article","created":{"date-parts":[[2009,5,8]],"date-time":"2009-05-08T14:48:41Z","timestamp":1241794121000},"page":"569-582","source":"Crossref","is-referenced-by-count":8,"title":["Competitive Algorithms for Due Date Scheduling"],"prefix":"10.1007","volume":"59","author":[{"given":"Nikhil","family":"Bansal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ho-Leung","family":"Chan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kirk","family":"Pruhs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,5,9]]},"reference":[{"key":"9321_CR1","first-page":"100","volume-title":"Symposium on Foundations of Computer Science","author":"S. Baruah","year":"1991","unstructured":"Baruah, S., Koren, G., Mishra, B., Raghunathan, A., Rosier, L., Shasha, D.: On-line scheduling in the presence of overload. In: Symposium on Foundations of Computer Science, pp. 100\u2013110. IEEE Comput. Soc., Los Alamitos (1991)"},{"issue":"3","key":"9321_CR2","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/j.jda.2005.12.001","volume":"4","author":"L. Becchetti","year":"2006","unstructured":"Becchetti, L., Leonardi, S., Marchetti-Spaccamela, A., Pruhs, K.: Online weighted flow time and deadline scheduling. J. Discrete Algorithms 4(3), 339\u2013352 (2006)","journal-title":"J. Discrete Algorithms"},{"key":"9321_CR3","first-page":"105","volume":"75","author":"M. Fisher","year":"1997","unstructured":"Fisher, M.: What is the right supply chain for your product. Harvard Bus. Rev. 75, 105\u2013116 (1997)","journal-title":"Harvard Bus. Rev."},{"issue":"4","key":"9321_CR4","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1145\/347476.347479","volume":"47","author":"B. Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. J. ACM 47(4), 617\u2013643 (2000)","journal-title":"J. ACM"},{"key":"9321_CR5","volume-title":"Handbook of Scheduling: Algorithms, Models, and Performance Analysis","author":"P. Kaminsky","year":"2004","unstructured":"Kaminsky, P., Hochbaum, D.: Due date quotation models and algorithms. In: Leung, J.Y.-T. (ed.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis. CRC Press, Boca Raton (2004). Chap. 20"},{"key":"9321_CR6","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/978-1-4020-7953-5_12","volume-title":"Handbook of Quantitative Supply Chain Analysis: Modeling in the E-Business Era","author":"P. Keskinocak","year":"2004","unstructured":"Keskinocak, P., Tayur, S.: Due date management policies. In: Simchi-Levi, D., Wu, S.D., Shen, Z.-J. (eds.) Handbook of Quantitative Supply Chain Analysis: Modeling in the E-Business Era, pp. 485\u2013554. Springer, Berlin (2004)"},{"issue":"2","key":"9321_CR7","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1287\/mnsc.47.2.264.9836","volume":"47","author":"P. Keskinocak","year":"2001","unstructured":"Keskinocak, P., Ravi, R., Tayur, S.: Scheduling and reliable lead-time quotation for orders with availability intervals and lead-time sensitive revenues. Manag. Sci. 47(2), 264\u2013279 (2001)","journal-title":"Manag. Sci."},{"issue":"4","key":"9321_CR8","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1145\/1243401.1243411","volume":"34","author":"K. Pruhs","year":"2007","unstructured":"Pruhs, K.: Competitive online scheduling for server systems. SIGMETRICS Perform. Eval. Rev. 34(4), 52\u201358 (2007)","journal-title":"SIGMETRICS Perform. Eval. Rev."},{"key":"9321_CR9","volume-title":"Handbook of Scheduling: Algorithms, Models, and Performance Analysis","author":"K. Pruhs","year":"2004","unstructured":"Pruhs, K., Sgall, J., Torng, E.: Online scheduling. In: Leung, J.Y.-T. (ed.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis. CRC Press, Boca Raton (2004)"},{"key":"9321_CR10","first-page":"41","volume":"66","author":"G. Stalk","year":"1988","unstructured":"Stalk, G.: Time\u2014the next source of competitive advantage. Harvard Bus. Rev. 66, 41\u201351 (1988)","journal-title":"Harvard Bus. Rev."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9321-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-009-9321-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9321-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:45:04Z","timestamp":1559123104000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-009-9321-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,9]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["9321"],"URL":"https:\/\/doi.org\/10.1007\/s00453-009-9321-4","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,5,9]]}}}