{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T02:13:26Z","timestamp":1771294406253,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540602200","type":"print"},{"value":"9783540447474","type":"electronic"}],"license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60220-8_53","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:53:14Z","timestamp":1330260794000},"page":"86-97","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":41,"title":["Scheduling jobs that arrive over time"],"prefix":"10.1007","author":[{"given":"Cynthia","family":"Phillips","sequence":"first","affiliation":[]},{"given":"Clifford","family":"Stein","sequence":"additional","affiliation":[]},{"given":"Joel","family":"Wein","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"8_CR1","unstructured":"K. R. Baker. Introduction to Sequencing and Scheduling. Wiley, 1974."},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/361011.361064","volume":"17","author":"J. Bruno","year":"1974","unstructured":"J. Bruno, E.G. Coffman Jr., and R. Sethi. Scheduling independent tasks to reduce mean finishing time. Communications of the ACM, 17:382\u2013387, 1974.","journal-title":"Communications of the ACM"},{"key":"8_CR3","volume-title":"Technical report","author":"J. Du","year":"1988","unstructured":"J. Du, J.Y.-T. Leung, and G.H. Young. Minimizing mean flow time with release time constraints. Technical report, University of Texas at Dallas, 1988."},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1145\/321978.321985","volume":"23","author":"T. Gonzalez","year":"1976","unstructured":"T. Gonzalez and S. Sahni. Open shop scheduling to minimize finish time. Journal of the ACM, 23:665\u2013679, 1976.","journal-title":"Journal of the ACM"},{"key":"8_CR5","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1287\/opre.21.3.846","volume":"21","author":"W. Horn","year":"1973","unstructured":"W. Horn. Minimizing average flow time with parallel machines. Operations Research, 21:846\u2013847, 1973.","journal-title":"Operations Research"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1137\/0215081","volume":"15","author":"T. Kawaguchi","year":"1986","unstructured":"T. Kawaguchi and S. Kyan. Worst case bound of an lrf schedule for the mean weighted flow-time problem. SIAM Journal on Computing, 15:1119\u20131129, 1986.","journal-title":"SIAM Journal on Computing"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"J. Labetoulle, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinooy Kan. Preemptive scheduling of uniform machines subject to release dates. In W.R. Pulleyblank, editor, Progress in Combinatorial Optimization, pp. 245\u2013261. Academic Press, 1984.","DOI":"10.1016\/B978-0-12-566780-7.50020-9"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"E.L. Lawler, J.K. Lenstra, A.H.G. Rinooy Kan, and D.B. Shmoys. Sequencing and scheduling: Algorithms and complexity. In S.C Graves, A.H.G. Rinnooy Kan, and P.H. Zipkin, editors, Handbooks in Operations Research and Management Science, Vol 4., Logistics of Production and Inventory, pages pp 445\u2013522. 1993.","DOI":"10.1016\/S0927-0507(05)80189-6"},{"key":"8_CR9","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"J.K. Lenstra","year":"1977","unstructured":"J.K. Lenstra, A.H.G. Rinnooy Kan, and P. Brucker. Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1:343\u2013362, 1977.","journal-title":"Annals of Discrete Mathematics"},{"key":"8_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","volume":"6","author":"R. McNaughton","year":"1959","unstructured":"R. McNaughton. Scheduling with deadlines and loss functions. Management Science, 6:1\u201312, 1959.","journal-title":"Management Science"},{"key":"8_CR11","unstructured":"R. Motwani, S. Phillips, and E. Torng. Non-clairvoyant scheduling. In Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms, pp. 422\u2013431, Jan. 1993."},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"C. Phillips, C. Stein, and J. Wein. Task scheduling in networks. In Proceedings of Fourth Scandinavian Workshop on Algorithm Theory, pages 290\u2013301, 1994.","DOI":"10.1007\/3-540-58218-5_27"},{"key":"8_CR13","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"W.E. Smith","year":"1956","unstructured":"W.E. Smith. Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3:59\u201366, 1956.","journal-title":"Naval Research Logistics Quarterly"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60220-8_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T21:02:49Z","timestamp":1578517369000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60220-8_53"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602200","9783540447474"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-60220-8_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}