{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T12:09:27Z","timestamp":1772021367558,"version":"3.50.1"},"reference-count":5,"publisher":"Elsevier BV","issue":"3-5","license":[{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1998,10]]},"DOI":"10.1016\/s0167-6377(98)00032-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:14:29Z","timestamp":1027624469000},"page":"113-116","source":"Crossref","is-referenced-by-count":38,"title":["Preemptive on-line scheduling for two uniform processors"],"prefix":"10.1016","volume":"23","author":[{"given":"Jianjun","family":"Wen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donglei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(98)00032-7_BIB1","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0167-6377(95)00039-9","article-title":"An optimal algorithm for preemptive on-line scheduling","volume":"18","author":"Chen","year":"1995","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(98)00032-7_BIB2","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/322047.322055","article-title":"Preemptive scheduling of uniform processor systems","volume":"25","author":"Gonzalez","year":"1978","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0167-6377(98)00032-7_BIB3","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: a survey","volume":"5","author":"Graham","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0167-6377(98)00032-7_BIB4","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01762111","article-title":"Competitive snoopy efficiency","volume":"3","author":"Karlin","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/S0167-6377(98)00032-7_BIB5","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","article-title":"Amortized efficiency of list update and paging rules","volume":"28","author":"Sleator","year":"1985","journal-title":"Comm. ACM"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637798000327?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637798000327?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T04:54:40Z","timestamp":1555563280000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637798000327"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,10]]},"references-count":5,"journal-issue":{"issue":"3-5","published-print":{"date-parts":[[1998,10]]}},"alternative-id":["S0167637798000327"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(98)00032-7","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1998,10]]}}}