{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:36:08Z","timestamp":1759667768854},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,10,27]],"date-time":"2011-10-27T00:00:00Z","timestamp":1319673600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s10878-011-9425-z","type":"journal-article","created":{"date-parts":[[2011,10,26]],"date-time":"2011-10-26T19:40:55Z","timestamp":1319658055000},"page":"448-464","source":"Crossref","is-referenced-by-count":1,"title":["Semi-online scheduling for jobs with release times"],"prefix":"10.1007","volume":"26","author":[{"given":"Rongheng","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liying","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoqiong","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiayan","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,10,27]]},"reference":[{"key":"9425_CR1","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":"9425_CR2","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham RL (1969) Bounds on multiprocessing timing anomalies. SIAM J Appl Math 17:416\u2013429","journal-title":"SIAM J Appl Math"},{"key":"9425_CR3","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1109\/SFCS.1989.63468","volume-title":"Proceedings of 30th ann IEEE symp on foundations of computer science","author":"LA Hall","year":"1989","unstructured":"Hall LA, Shmoys DB (1989) Approximation schemes for constrained scheduling problems. In: Proceedings of 30th ann IEEE symp on foundations of computer science. IEEE Comput Soc, Los Alamitos, pp 134\u2013139"},{"key":"9425_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":"9425_CR5","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 MG, Tuza Z (1997) Semi on-line algorithms for the partition problem. Oper Res Lett 21:235\u2013242","journal-title":"Oper Res Lett"},{"key":"9425_CR6","first-page":"79","volume":"73","author":"R Li","year":"2004","unstructured":"Li R, Huang HC (2004) On-line scheduling for jobs with arbitrary release times. Computing 73:79\u201397","journal-title":"Computing"},{"issue":"6","key":"9425_CR7","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s10951-007-0042-8","volume":"10","author":"R Li","year":"2007","unstructured":"Li R, Huang HC (2007) List scheduling for jobs with arbitrary release times and similar lengths. J Sched 10(6):365\u2013373","journal-title":"J Sched"},{"key":"9425_CR8","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0167-6377(95)00058-5","volume":"18","author":"WP Liu","year":"1996","unstructured":"Liu WP, Sidney JB, Vliet A (1996) Ordinal algorithm for parallel machine scheduling. Oper Res Lett 18:223\u2013232","journal-title":"Oper Res Lett"},{"key":"9425_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 GJ (2000) Semi-online scheduling with decreasing job sizes. Oper Res Lett 27:215\u2013227","journal-title":"Oper Res Lett"},{"key":"9425_CR10","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1016\/S0167-6377(02)00164-5","volume":"30","author":"ZY Tan","year":"2002","unstructured":"Tan ZY, He Y (2002) Semi-online problem on two identical machines with combined partial information. Oper Res Lett 30:408\u2013414","journal-title":"Oper Res Lett"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9425-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-011-9425-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9425-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:16Z","timestamp":1559276596000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-011-9425-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,27]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["9425"],"URL":"https:\/\/doi.org\/10.1007\/s10878-011-9425-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10,27]]}}}