{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:26:51Z","timestamp":1759667211606},"reference-count":12,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"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":[[2002,12]]},"DOI":"10.1016\/s0167-6377(02)00164-5","type":"journal-article","created":{"date-parts":[[2002,10,21]],"date-time":"2002-10-21T15:29:59Z","timestamp":1035214199000},"page":"408-414","source":"Crossref","is-referenced-by-count":43,"title":["Semi-on-line problems on two identical machines with combined partial information"],"prefix":"10.1016","volume":"30","author":[{"given":"Zhiyi","family":"Tan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(02)00164-5_BIB1","doi-asserted-by":"crossref","unstructured":"Y. Azar, O. Regev, Online bin stretching, Proceedings of the RANDOM\u201998, Barcelona, Spain, 1998, pp. 71\u201382.","DOI":"10.1007\/3-540-49543-6_7"},{"key":"10.1016\/S0167-6377(02)00164-5_BIB2","series-title":"Handbook of Combinatorial Optimization","article-title":"A review of machine scheduling: Complexity, algorithms and approximability","author":"Chen","year":"1998"},{"key":"10.1016\/S0167-6377(02)00164-5_BIB3","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0898-1221(00)00070-5","article-title":"The optimal on-line parallel machine scheduling","volume":"39","author":"He","year":"2000","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/S0167-6377(02)00164-5_BIB4","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1023\/A:1013855712183","article-title":"Ordinal online scheduling for maximizing the minimum machine completion time","volume":"6","author":"He","year":"2002","journal-title":"J. Combin. Optim."},{"key":"10.1016\/S0167-6377(02)00164-5_BIB5","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s006070050020","article-title":"Semi on-line scheduling on two identical machines","volume":"62","author":"He","year":"1999","journal-title":"Computing"},{"key":"10.1016\/S0167-6377(02)00164-5_BIB6","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/S0167-6377(98)00005-4","article-title":"Semi on-line algorithms for the partition problem","volume":"21","author":"Kellerer","year":"1997","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(02)00164-5_BIB7","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0167-6377(95)00058-5","article-title":"Ordinal algorithms for parallel machine scheduling","volume":"18","author":"Liu","year":"1996","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(02)00164-5_BIB8","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0167-6377(00)00053-5","article-title":"Semi-online scheduling with decreasing job sizes","volume":"27","author":"Seiden","year":"2000","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(02)00164-5_BIB9","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":"Commun. ACM"},{"key":"10.1016\/S0167-6377(02)00164-5_BIB10","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0167-6377(01)00071-2","article-title":"Semi-on-line scheduling with ordinal data on two uniform machines","volume":"28","author":"Tan","year":"2001","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(02)00164-5_BIB11","doi-asserted-by":"crossref","unstructured":"Z. Tan, Y. He, Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times. Comput. Math. Appl., to appear.","DOI":"10.1016\/S0898-1221(02)00115-3"},{"key":"10.1016\/S0167-6377(02)00164-5_BIB12","doi-asserted-by":"crossref","unstructured":"G.C. Zhang, D.S. Ye, A note on on-line scheduling with partial information, Comput. Math. Appl., to appear.","DOI":"10.1016\/S0898-1221(02)00168-2"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702001645?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702001645?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,10]],"date-time":"2020-03-10T23:42:46Z","timestamp":1583883766000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637702001645"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":12,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2002,12]]}},"alternative-id":["S0167637702001645"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(02)00164-5","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2002,12]]}}}