{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T12:09:26Z","timestamp":1772021366281,"version":"3.50.1"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[1998,6,1]],"date-time":"1998-06-01T00:00:00Z","timestamp":896659200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1998,6]]},"DOI":"10.1007\/bf01585873","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:42:50Z","timestamp":1114677770000},"page":"225-234","source":"Crossref","is-referenced-by-count":6,"title":["Scheduling uniform machines on-line requires nondecreasing speed ratios"],"prefix":"10.1007","volume":"82","author":[{"given":"Arjen P. A.","family":"Vestjens","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1006\/jcss.1995.1074","volume":"51","author":"Y. Bartal","year":"1995","unstructured":"Y. Bartal, A. Fiat, H. Karloff, R. Vohra, New algorithms for an ancient scheduling problem, Journal of Computer and System Sciences 51 (1995) 359\u2013366.","journal-title":"Journal of Computer and System Sciences"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0167-6377(95)00039-9","volume":"18","author":"B. Chen","year":"1995","unstructured":"B. Chen, A. van Vliet, G.J. Woeginger, An optimal algorithm for preemptive on-line scheduling, Operations Research Letters 18 (1995) 127\u2013131.","journal-title":"Operations Research Letters"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"1326","DOI":"10.1109\/12.166609","volume":"41","author":"K.S. Hong","year":"1992","unstructured":"K.S. Hong, J.Y.-T. Leung, On-line scheduling of real-time tasks, IEEE Transactions on Computers 41 (1992) 1326\u20131331.","journal-title":"IEEE Transactions on Computers"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/B978-0-12-566780-7.50020-9","volume-title":"Progress in Combinatorial Optimization","author":"J. Labetoulle","year":"1984","unstructured":"J. Labetoulle, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, Preemptive scheduling of uniform machines subject to release dates, in: W.R. Pulleyblank (Ed.), Progress in Combinatorial Optimization, Academic Press, Toronto, 1984, pp. 245\u2013261, ISBN 0-12-566780-9."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/322047.322055","volume":"25","author":"T. Gonzalez","year":"1978","unstructured":"T. Gonzalez, S. Sahni, Preemptive scheduling of uniform processor systems, Journal of the ACM 25 (1978) 92\u2013101.","journal-title":"Journal of the ACM"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","volume-title":"Logistics of Production and Inventory, Handbooks in OR and MS 4","author":"E.L. Lawler","year":"1993","unstructured":"E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys, Sequencing and scheduling: algorithms and complexity, in: S.C. Graves, A.H.G. Rinnooy Kan, P.H. Zipkin (Eds.), Logistics of Production and Inventory, Handbooks in OR and MS 4, Elsevier, Amsterdam, Ch. 9, 1993, pp. 445\u2013522, ISBN 0-444-87472-0."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1145\/321992.321995","volume":"24","author":"E.C. Horvath","year":"1977","unstructured":"E.C. Horvath, S. Lam, R. Sethi, A level algorithm for preemptive scheduling, Journal of the ACM 24 (1977) 32\u201343.","journal-title":"Journal of the ACM"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1137\/0208020","volume":"8","author":"S. Sahni","year":"1979","unstructured":"S. Sahni, Y. Cho, Nearly on-line scheduling of a uniform processor system with release times, SIAM Journal on Computing 8 (1979) 275\u2013285.","journal-title":"SIAM Journal on Computing"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585873.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01585873\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585873","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:32:33Z","timestamp":1556897553000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01585873"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,6]]},"references-count":8,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,6]]}},"alternative-id":["BF01585873"],"URL":"https:\/\/doi.org\/10.1007\/bf01585873","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,6]]}}}