{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:09:15Z","timestamp":1759666155250},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,7,22]],"date-time":"2009-07-22T00:00:00Z","timestamp":1248220800000},"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":[[2011,5]]},"DOI":"10.1007\/s10878-009-9254-5","type":"journal-article","created":{"date-parts":[[2009,7,21]],"date-time":"2009-07-21T20:40:01Z","timestamp":1248208801000},"page":"393-408","source":"Crossref","is-referenced-by-count":6,"title":["Semi-online scheduling on two uniform machines with\u00a0the\u00a0known largest size"],"prefix":"10.1007","volume":"21","author":[{"given":"Sheng-Yi","family":"Cai","sequence":"first","affiliation":[]},{"given":"Qi-Fan","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,7,22]]},"reference":[{"key":"9254_CR1","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.tcs.2007.12.005","volume":"393","author":"E Angelelli","year":"2008","unstructured":"Angelelli E, Speranza MG, Tuza Z (2008) Semi online scheduling on two uniform processors. Theor Comput Sci 393:211\u2013219","journal-title":"Theor Comput Sci"},{"key":"9254_CR2","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1137\/0209007","volume":"9","author":"Y Cho","year":"1980","unstructured":"Cho Y, Shani S (1980) Bounds for list schedules on uniform processors. SIAM J Comput 9:91\u2013103","journal-title":"SIAM J Comput"},{"key":"9254_CR3","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s00607-005-0130-6","volume":"76","author":"G Dosa","year":"2006","unstructured":"Dosa G, He Y (2006) Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines. Computing 76:149\u2013164","journal-title":"Computing"},{"key":"9254_CR4","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s00236-002-0102-7","volume":"39","author":"L Epstein","year":"2003","unstructured":"Epstein L (2003) Bin stretching revisited. Acta Inform 39:97\u2013117","journal-title":"Acta Inform"},{"key":"9254_CR5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/S0167-6377(02)00179-7","volume":"30","author":"L Epstein","year":"2002","unstructured":"Epstein L, Favrholdt LM (2002) Optimal preemptive semi-online scheduling to minimize makespan on two related machines. Oper Res Lett 30:269\u2013275","journal-title":"Oper Res Lett"},{"issue":"1","key":"9254_CR6","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.jalgor.2004.11.002","volume":"57","author":"L Epstein","year":"2005","unstructured":"Epstein L, Favrholdt LM (2005) Optimal non-preemptive semi-online scheduling on two related machines. J Algorithms 57(1):49\u201373","journal-title":"J Algorithms"},{"issue":"1","key":"9254_CR7","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s10878-006-9040-6","volume":"14","author":"L Epstein","year":"2007","unstructured":"Epstein L, Ye DH (2007) Semi-online scheduling with \u201cend of sequence\u201d information. J Comb Optim 14(1):45\u201361","journal-title":"J Comb Optim"},{"issue":"2","key":"9254_CR8","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1002\/jos.60","volume":"4","author":"L Epstein","year":"2001","unstructured":"Epstein L, Noga J, Seiden SS, Sgall J, Woeginger GJ (2001) Randomized on-line scheduling on two uniform machines. J Sched 4(2):71\u201392","journal-title":"J Sched"},{"issue":"5","key":"9254_CR9","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(5):235\u2013242","journal-title":"Oper Res Lett"},{"issue":"8\u201310","key":"9254_CR10","doi-asserted-by":"crossref","first-page":"776","DOI":"10.1016\/j.tcs.2008.11.018","volume":"410","author":"CT Ng","year":"2009","unstructured":"Ng CT, Tan Z, He Y, Cheng TCE (2009) Two semi-online scheduling problems on two uniform machines. Theor Comput Sci 410(8\u201310):776\u2013792","journal-title":"Theor Comput Sci"},{"key":"9254_CR11","first-page":"15-1","volume-title":"Handbook of scheduling: Algorithms, models, and performance analysis","author":"K Pruhs","year":"2004","unstructured":"Pruhs K, Sgall J, Torng E (2004) Online scheduling. In: Leung JY-T (ed) Handbook of scheduling: Algorithms, models, and performance analysis. CRC Press, Boca Raton, pp 15-1\u201315-41 (Chapter 15)"},{"key":"9254_CR12","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0167-6377(98)00032-7","volume":"23","author":"J Wen","year":"1998","unstructured":"Wen J, Du D (1998) Preemptive on-line scheduling for two uniform processors. Oper Res Lett 23:113\u2013116","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-009-9254-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-009-9254-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9254-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:14Z","timestamp":1559276294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-009-9254-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,22]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["9254"],"URL":"https:\/\/doi.org\/10.1007\/s10878-009-9254-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,7,22]]}}}