{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T19:28:19Z","timestamp":1773689299637,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"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":[[2001,6]]},"DOI":"10.1016\/s0167-6377(01)00071-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:59:48Z","timestamp":1027609188000},"page":"221-231","source":"Crossref","is-referenced-by-count":18,"title":["Semi-on-line scheduling with ordinal data on two uniform machines"],"prefix":"10.1016","volume":"28","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(01)00071-2_BIB1","unstructured":"A. Agnetis, No-wait flow shop scheduling with large lot size, Rap 16.89, Dipartimento di Informatica e Sistemistica, Universita Degli Studi di Roma \u201cLa Sapienza\u201d, Rome, Italy, 1989."},{"key":"10.1016\/S0167-6377(01)00071-2_BIB2","doi-asserted-by":"crossref","unstructured":"Y. Azar, O. Regev, Online bin stretching, Proceedings of RANDOM\u201998, 1998, pp. 71\u201382.","DOI":"10.1007\/3-540-49543-6_7"},{"key":"10.1016\/S0167-6377(01)00071-2_BIB3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1137\/0209007","article-title":"Bounds for list scheduling on uniform processors","volume":"9","author":"Cho","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-6377(01)00071-2_BIB4","unstructured":"L. Epstein, J. Noga, S. Seiden, J. Sgall, G. Woeginger, Randomized online scheduling on two uniform machines, Proceedings of the 10th ACM\u2013SIAM Symposium on Discrete Algorithms, 1999, pp. 317\u2013326."},{"key":"10.1016\/S0167-6377(01)00071-2_BIB5","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF02669690","article-title":"Semi on-line scheduling problem for maximizing the minimum machine completion time","volume":"17","author":"He","year":"2001","journal-title":"Acta Math. Appl. Sinica"},{"key":"10.1016\/S0167-6377(01)00071-2_BIB6","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s006070050020","article-title":"Semi online scheduling on two identical machines","volume":"62","author":"He","year":"1999","journal-title":"Computing"},{"key":"10.1016\/S0167-6377(01)00071-2_BIB7","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/S0167-6377(98)00005-4","article-title":"Semi online algorithms for the partition problem","volume":"21","author":"Kellerer","year":"1997","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(01)00071-2_BIB8","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/S0167-6377(01)00071-2_BIB9","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0167-6377(96)00002-8","article-title":"Bin packing using semi-ordinal data","volume":"19","author":"Liu","year":"1996","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(01)00071-2_BIB10","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(01)00071-2_BIB11","unstructured":"S. Seiden, J. Sgall, G. Woeginger, Semi-online scheduling with decreasing job sizes, Technical Report Woe-36, TU Graz, Austria, 1998."},{"key":"10.1016\/S0167-6377(01)00071-2_BIB12","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:S0167637701000712?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637701000712?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T00:00:08Z","timestamp":1578614408000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637701000712"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["S0167637701000712"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(01)00071-2","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}