{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T13:15:31Z","timestamp":1773839731754,"version":"3.50.1"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2007,10,20]],"date-time":"2007-10-20T00:00:00Z","timestamp":1192838400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2007,10,25]]},"DOI":"10.1007\/s10951-007-0042-8","type":"journal-article","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T08:56:23Z","timestamp":1192784183000},"page":"365-373","source":"Crossref","is-referenced-by-count":11,"title":["List scheduling for jobs with arbitrary release times and similar lengths"],"prefix":"10.1007","volume":"10","author":[{"given":"Rongheng","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huei-Chuen","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,10,20]]},"reference":[{"key":"42_CR1","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0304-3975(00)00258-9","volume":"268","author":"Y. Azar","year":"2001","unstructured":"Azar, Y., & Regev, O. (2001). On-line bin stretching. Theoretical Computer Science, 268, 17\u201341.","journal-title":"Theoretical Computer Science"},{"key":"42_CR2","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s00607-003-0034-2","volume":"72","author":"G. D\u00f3sa","year":"2004","unstructured":"D\u00f3sa, G., & He, Y. (2004). Semi-online algorithms for parallel machine scheduling problems. Computing, 72, 355\u2013363.","journal-title":"Computing"},{"key":"42_CR3","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R. L. Graham","year":"1969","unstructured":"Graham, R. L. (1969). Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 17, 416\u2013429.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"42_CR4","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s006070050020","volume":"62","author":"Y. He","year":"1999","unstructured":"He, Y., & Zhang, G. (1999). Semi on-line scheduling on two identical machines. Computing, 62, 179\u2013187.","journal-title":"Computing"},{"key":"42_CR5","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF02238297","volume":"46","author":"H. Kellerer","year":"1991","unstructured":"Kellerer, H. (1991). Bounds for non-preemptive scheduling jobs with similar processing times on multiprocessor systems using LPT-algorithm. Computing, 46, 183\u2013191.","journal-title":"Computing"},{"key":"42_CR6","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/S0167-6377(98)00005-4","volume":"21","author":"H. Kellerer","year":"1997","unstructured":"Kellerer, H., Kotov, V., Speranza, M. G., & Tuza, Z. (1997). Semi on-line algorithms for the partition problem. Operations Research Letters, 21, 235\u2013242.","journal-title":"Operations Research Letters"},{"key":"42_CR7","first-page":"79","volume":"73","author":"R. Li","year":"2004","unstructured":"Li, R., & Huang, H. C. (2004). On-line scheduling for jobs with arbitrary release times. Computing, 73, 79\u201397.","journal-title":"Computing"},{"key":"42_CR8","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0167-6377(95)00058-5","volume":"18","author":"W. P. Liu","year":"1996","unstructured":"Liu, W. P., Sidney, J. B., & Vliet, A. (1996). Ordinal algorithm for parallel machine scheduling. Operations Research Letters, 18, 223\u2013232.","journal-title":"Operations Research Letters"},{"key":"42_CR9","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0167-6377(00)00053-5","volume":"27","author":"S. Seiden","year":"2000","unstructured":"Seiden, S., Sgall, J., & Woeginger, G. J. (2000). Semi-online scheduling with decreasing job sizes. Operations Research Letters, 27, 215\u2013227.","journal-title":"Operations Research Letters"},{"key":"42_CR10","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1016\/S0167-6377(02)00164-5","volume":"30","author":"Z. Y. Tan","year":"2002","unstructured":"Tan, Z. Y., & He, Y. (2002). Semi-online problem on two identical machines with combined partial information. Operations Research Letters, 30, 408\u2013414.","journal-title":"Operations Research Letters"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-007-0042-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-007-0042-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-007-0042-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:40Z","timestamp":1559453980000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-007-0042-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,20]]},"references-count":10,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2007,10,25]]}},"alternative-id":["42"],"URL":"https:\/\/doi.org\/10.1007\/s10951-007-0042-8","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,20]]}}}