{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T15:50:33Z","timestamp":1787068233274,"version":"3.56.0"},"reference-count":6,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1997,11,1]],"date-time":"1997-11-01T00:00:00Z","timestamp":878342400000},"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":[[1997,11]]},"DOI":"10.1016\/s0167-6377(97)00040-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:14:29Z","timestamp":1027624469000},"page":"165-169","source":"Crossref","is-referenced-by-count":79,"title":["Scheduling on identical machines: How good is LPT in an on-line setting?"],"prefix":"10.1016","volume":"21","author":[{"given":"Bo","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arjen P.A.","family":"Vestjens","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(97)00040-0_BIB1","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","article-title":"Bounds on multiprocessing timing anomalies","volume":"17","author":"Graham","year":"1969","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0167-6377(97)00040-0_BIB2","series-title":"Proc. 30th Ann. IEEE Symp. on Foundations of Computer Science","first-page":"134","article-title":"Approximation schemes for constrained scheduling problems","author":"Hall","year":"1989"},{"key":"10.1016\/S0167-6377(97)00040-0_BIB3","doi-asserted-by":"crossref","first-page":"1326","DOI":"10.1109\/12.166609","article-title":"On-line scheduling of real-time tasks","volume":"41","author":"Hong","year":"1992","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-6377(97)00040-0_BIB4","unstructured":"J. Sgall, On-line scheduling \u2014 a survey, in: A. Fiat and G.J. Woeginger (eds.), On-line Algorithms, Lecture Notes in Computer Science, to appear."},{"key":"10.1016\/S0167-6377(97)00040-0_BIB5","doi-asserted-by":"crossref","first-page":"1313","DOI":"10.1137\/S0097539793248317","article-title":"Scheduling parallel machines on-line","volume":"24","author":"Shmoys","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-6377(97)00040-0_BIB6","doi-asserted-by":"crossref","unstructured":"A.P.A. Vestjens, Scheduling uniform machines on-line requires nondecreasing speed ratios, Math. Programming (B), to appear.","DOI":"10.1007\/BF01585873"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637797000400?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637797000400?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:16Z","timestamp":1555563256000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637797000400"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,11]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1997,11]]}},"alternative-id":["S0167637797000400"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(97)00040-0","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1997,11]]}}}