{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T18:40:49Z","timestamp":1783190449055,"version":"3.54.6"},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,8,17]],"date-time":"2010-08-17T00:00:00Z","timestamp":1282003200000},"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":[[2012,2]]},"DOI":"10.1007\/s10878-010-9348-0","type":"journal-article","created":{"date-parts":[[2010,8,16]],"date-time":"2010-08-16T17:02:55Z","timestamp":1281978175000},"page":"189-195","source":"Crossref","is-referenced-by-count":9,"title":["An optimal online algorithm for single machine scheduling to minimize total general completion time"],"prefix":"10.1007","volume":"23","author":[{"given":"Ming","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chengbin","family":"Chu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yinfeng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiazhen","family":"Huo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,8,17]]},"reference":[{"key":"9348_CR1","volume-title":"Online computation and competitive analysis","author":"A Borodin","year":"1998","unstructured":"Borodin A, El-Yaniv R (1998) Online computation and competitive analysis. Cambridge University Press, Cambridge"},{"key":"9348_CR2","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/S0167-6377(03)00016-6","volume":"31","author":"X Lu","year":"2003","unstructured":"Lu X, Sitters RA, Stougie L (2003) A class of on-line scheduling algorithms to minimize total completion time. Oper Res Lett 31:232\u2013236","journal-title":"Oper Res Lett"},{"key":"9348_CR3","unstructured":"Pruhs K, Sgall J, Torng E (2004) Online scheduling. In: Leung JY-T (ed) Handbook of scheduling: Algorithms, models, and performance analysis"},{"key":"9348_CR4","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.jalgor.2004.10.001","volume":"57","author":"RV Stee","year":"2005","unstructured":"Stee RV, Poutre HL (2005) Minimizing the total completion time on-line on a single machine, using restarts. J Algorithms 57:95\u2013129","journal-title":"J Algorithms"},{"key":"9348_CR5","unstructured":"Vestjens APA (1997) On-line machine scheduling. PhD Thesis, Eindhoven University of Technology, Netherlands"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9348-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9348-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9348-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:14Z","timestamp":1559262194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9348-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,17]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["9348"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9348-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,8,17]]}}}