{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:18:45Z","timestamp":1759666725078},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,1,3]],"date-time":"2007-01-03T00:00:00Z","timestamp":1167782400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2007,1,3]],"date-time":"2007-01-03T00:00:00Z","timestamp":1167782400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2007,7]]},"DOI":"10.1007\/s10878-006-9040-6","type":"journal-article","created":{"date-parts":[[2007,1,2]],"date-time":"2007-01-02T16:54:56Z","timestamp":1167756896000},"page":"45-61","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Semi-online scheduling with \u201cend of sequence\u201d information"],"prefix":"10.1007","volume":"14","author":[{"given":"Leah","family":"Epstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deshi","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,1,3]]},"reference":[{"key":"9040_CR1","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1023\/B:JOSH.0000046074.03560.5d","volume":"7","author":"E Angelelli","year":"2004","unstructured":"Angelelli E, Nagy A, Speranza M, Tuza Z (2004) The on-line multiprocessor scheduling problem with known sum of the tasks. J Sched 7:421\u2013428","journal-title":"J Sched"},{"key":"9040_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0304-3975(00)00258-9","volume":"268","author":"Y Azar","year":"2001","unstructured":"Azar Y, Regev O (2001) Online bin stretching. Theor Comput Sci 268:17\u201341","journal-title":"Theor Comput Sci"},{"key":"9040_CR3","doi-asserted-by":"publisher","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"},{"issue":"2","key":"9040_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s00236-002-0102-7","volume":"39","author":"L Epstein","year":"2003","unstructured":"Epstein L (2003) Bin Stretching revisted. Acta Inform 39(2):97\u2013117","journal-title":"Acta Inform"},{"issue":"2","key":"9040_CR5","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.dam.2005.02.002","volume":"148","author":"L Epstein","year":"2005","unstructured":"Epstein L (2005) Tight bounds for bandwidth allocation on two links. Discrete Appl Math 148(2):181\u2013188","journal-title":"Discrete Appl Math"},{"issue":"1","key":"9040_CR6","doi-asserted-by":"publisher","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":"2","key":"9040_CR7","doi-asserted-by":"publisher","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 online scheduling on two uniform machines. J Sched 4(2):71\u201392","journal-title":"J Sched"},{"key":"9040_CR8","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R Graham","year":"1966","unstructured":"Graham R (1966) Bounds for certain multiprocessing anomalies. Bell Sys Techn J 45:1563\u20131581.","journal-title":"Bell Sys Techn J"},{"issue":"2","key":"9040_CR9","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R Graham","year":"1969","unstructured":"Graham R (1969) Bounds on multiprocessing timing anomalies. SIAM J Appl Math 17(2):416\u2013429","journal-title":"SIAM J Appl Math"},{"key":"9040_CR10","doi-asserted-by":"publisher","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":"9040_CR11","doi-asserted-by":"publisher","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 Rese Lett 21:235\u2013242","journal-title":"Oper Rese Lett"},{"key":"9040_CR12","doi-asserted-by":"crossref","unstructured":"Sanders P, Sivadasan N, Skutella M (2004) Online Scheduling with Bounded Migration. In: Proceedings of automata, languages and programming: 31st international colloquium, (ICALP 2004), lecture notes in computer science. Vol 3142, pp 1111\u20131122.","DOI":"10.1007\/978-3-540-27836-8_92"},{"key":"9040_CR13","doi-asserted-by":"publisher","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 (2000) Semi-online scheduling with decreasing job sizes. Oper Res Lett 27:215\u2013221","journal-title":"Oper Res Lett"},{"key":"9040_CR14","doi-asserted-by":"crossref","unstructured":"Sgall J (1998) On-line scheduling. Online algorithms\u2014the state of art, lecture notes in computer science. vol 1442, pp 196\u2013231","DOI":"10.1007\/BFb0029570"},{"key":"9040_CR15","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1016\/S0167-6377(02)00164-5","volume":"30","author":"Z Tan","year":"2002","unstructured":"Tan Z, He Y (2002) Semi-on-line problems on two identical machines with combined partial information. Oper Res Lett 30:408\u2013414","journal-title":"Oper Res Lett"},{"key":"9040_CR16","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0020-0190(97)00006-9","volume":"61","author":"G Zhang","year":"1997","unstructured":"Zhang G (1997) A simple semi on-line algorithm for P2\/\/C\n                           max with a buffer. Inform Process Lett 61:145\u2013148.","journal-title":"Inform Process Lett"},{"key":"9040_CR17","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/S0898-1221(02)00168-2","volume":"44","author":"G Zhang","year":"2002","unstructured":"Zhang G, Ye D (2002) A note on on-line scheduling with partial information. Comput Math Appl 44:539\u2013543.","journal-title":"Comput Math Appl"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-9040-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-006-9040-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-9040-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-9040-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,17]],"date-time":"2022-05-17T22:27:29Z","timestamp":1652826449000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-006-9040-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,1,3]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,7]]}},"alternative-id":["9040"],"URL":"https:\/\/doi.org\/10.1007\/s10878-006-9040-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,1,3]]},"assertion":[{"value":"3 January 2007","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}