{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:59:39Z","timestamp":1774418379550,"version":"3.50.1"},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6925,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,8]]},"DOI":"10.1016\/0304-3975(94)90150-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"5-16","source":"Crossref","is-referenced-by-count":106,"title":["On-line scheduling of jobs with fixed start and end times"],"prefix":"10.1016","volume":"130","author":[{"given":"Gerhard J.","family":"Woeginger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90150-3_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(87)90037-0","article-title":"Scheduling jobs with fixed start and end times","volume":"18","author":"Arkin","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0304-3975(94)90150-3_BIB2","first-page":"176","article-title":"Searching with uncertainty","author":"Baeza-Yates","year":"1988","journal-title":"Proc. Scandinavian Workshop on Algorithm Theory"},{"key":"10.1016\/0304-3975(94)90150-3_BIB3","first-page":"379","article-title":"On the power of randomization in on-line algorithms","author":"Ben-David","year":"1990","journal-title":"Proc. 22nd Ann. Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(94)90150-3_BIB4","series-title":"Tech. Report 979","article-title":"Greedy k-coverings of interval orders","author":"Faigle","year":"1991"},{"key":"10.1016\/0304-3975(94)90150-3_BIB5","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1137\/0203025","article-title":"Worst case performance bounds for simple one-dimensional bin packing algorithms","volume":"3","author":"Johnson","year":"1974","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)90150-3_BIB6","first-page":"63","article-title":"An effective version of Dilworth's theorem","volume":"268","author":"Kierstead","year":"1981","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(94)90150-3_BIB7","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0012-365X(89)90096-4","article-title":"An on-line graph coloring algorithm with sublinear performance ratio","volume":"75","author":"Lov\u00e1sz","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(94)90150-3_BIB8","first-page":"322","article-title":"Competitive algorithms for on-line problems","author":"Manasse","year":"1988","journal-title":"Proc. 20th Ann. Symp. on Theory of Computing"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594901503?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594901503?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:28:06Z","timestamp":1555129686000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594901503"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["0304397594901503"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90150-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}