{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T06:43:40Z","timestamp":1648795420376},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,8,20]],"date-time":"2006-08-20T00:00:00Z","timestamp":1156032000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["cent.eur.j.oper.res."],"published-print":{"date-parts":[[2007,3,8]]},"DOI":"10.1007\/s10100-006-0003-x","type":"journal-article","created":{"date-parts":[[2006,8,19]],"date-time":"2006-08-19T07:27:31Z","timestamp":1155972451000},"page":"97-104","source":"Crossref","is-referenced-by-count":2,"title":["Extension of algorithm list scheduling for a semi-online scheduling problem"],"prefix":"10.1007","volume":"15","author":[{"given":"Yong","family":"He","sequence":"first","affiliation":[]},{"given":"Gy\u00f6rgy","family":"D\u00f3sa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,8,20]]},"reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1137\/S0097539797324874","volume":"29","author":"S Albers","year":"1999","unstructured":"Albers S (1999) Better bounds for on-line scheduling. SIAM J Comput 29(2):459\u2013473","journal-title":"SIAM J Comput"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Albers S (2002) On randomized online scheduling. In: Proceedings of the 34th ACM symposium on theory of computing. Montreal, pp 134\u2013143","DOI":"10.1145\/509907.509930"},{"key":"3_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0207001","volume":"7","author":"EE Coffman Jr","year":"1981","unstructured":"Coffman EE Jr, Garey MR, Johnson DS (1981) An application of bin-packing to multiprocessor scheduling. SIAM J Comput 7:1\u201317","journal-title":"SIAM J Comput"},{"key":"3_CR4","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":"3_CR5","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0167-6377(01)00098-0","volume":"29","author":"RR Goldberg","year":"2001","unstructured":"Goldberg RR, Shapiro J (2001) Extending Graham\u2019s result on scheduling to other heuristic. Oper Res Lett 29:149\u2013153","journal-title":"Oper Res Lett"},{"key":"3_CR6","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham RL (1969) Bounds on multiprocessor timing anomalies. SIAM J Appl Math 17:416\u2013429","journal-title":"SIAM J Appl Math"},{"key":"3_CR7","first-page":"107","volume":"9","author":"U Faigle","year":"1989","unstructured":"Faigle U, Kern W, Tur\u00e1n G (1989) On the performance of on-line algorithm for particular problems. Acta Cybern 9:107\u2013119","journal-title":"Acta Cybern"},{"key":"3_CR8","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0898-1221(00)00070-5","volume":"39","author":"Y He","year":"2000","unstructured":"He Y (2000) The optimal on-line parallel machine scheduling. Comput Math Appl 39:117\u2013121","journal-title":"Comput Math Appl"},{"key":"3_CR9","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.dam.2004.12.005","volume":"150","author":"Y He","year":"2005","unstructured":"He Y, D\u00f3sa G (2005) Semi-online scheduling jobs with tightly-grouped processing times on three identical machines. Discrete Appl Math 150:140\u2013159","journal-title":"Discrete Appl Math"},{"key":"3_CR10","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":"3_CR11","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"},{"issue":"(2","key":"3_CR12","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1006\/jagm.1996.0019","volume":"20","author":"DR Karger","year":"1996","unstructured":"Karger DR, Phillips SJ, Torng E (1996) A better algorithm for an ancient scheduling problem. J Algorithms 20 (2):400\u2013430","journal-title":"J Algorithms"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Sgall J (1998) On-line scheduling. On-line algorithms: the state of art. Lecture Notes in Computer Sciences, vol 1442. Springer, Berlin Heidelberg New York, pp 196\u2013231","DOI":"10.1007\/BFb0029570"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-006-0003-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-006-0003-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-006-0003-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:49:24Z","timestamp":1559123364000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-006-0003-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8,20]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,3,8]]}},"alternative-id":["3"],"URL":"https:\/\/doi.org\/10.1007\/s10100-006-0003-x","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,8,20]]}}}