{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T06:55:23Z","timestamp":1763535323684},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,2,8]],"date-time":"2015-02-08T00:00:00Z","timestamp":1423353600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s11590-015-0862-y","type":"journal-article","created":{"date-parts":[[2015,2,7]],"date-time":"2015-02-07T06:15:47Z","timestamp":1423289747000},"page":"159-168","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["LPT online strategy for parallel-machine scheduling with kind release times"],"prefix":"10.1007","volume":"10","author":[{"given":"Wenjie","family":"Li","sequence":"first","affiliation":[]},{"given":"Jinjiang","family":"Yuan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,2,8]]},"reference":[{"key":"862_CR1","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1287\/moor.1040.0092","volume":"29","author":"EJ Anderson","year":"2004","unstructured":"Anderson, E.J., Potts, C.N.: Online scheduling of a single machine to minimize total weighted completion time. Math. Oper. Res. 29, 686\u2013697 (2004)","journal-title":"Math. Oper. Res."},{"key":"862_CR2","volume-title":"Introduction to sequencing and scheduling","author":"KR Baker","year":"1974","unstructured":"Baker, K.R.: Introduction to sequencing and scheduling. Wiley, New York (1974)"},{"key":"862_CR3","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0167-6377(97)00040-0","volume":"21","author":"B Chen","year":"1997","unstructured":"Chen, B., Vestjens, A.P.A.: Scheduling on identical machines: how good is LPT in an on-line setting? Oper. Res. Lett. 21, 165\u2013169 (1997)","journal-title":"Oper. Res. Lett."},{"key":"862_CR4","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/322077.322090","volume":"25","author":"MR Garey","year":"1978","unstructured":"Garey, M.R., Johnson, D.S.: Strong NP-completenes results: motivation, examples and implications. J. Assoc. Comput. Mach. 25, 499\u2013508 (1978)","journal-title":"J. Assoc. Comput. Mach."},{"key":"862_CR5","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"RL Graham","year":"1966","unstructured":"Graham, R.L.: Bounds for certain multiprocessor anomalies. Bell Syst. Tech. J. 45, 1563\u20131581 (1966)","journal-title":"Bell Syst. Tech. J."},{"key":"862_CR6","first-page":"263","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17, 263\u2013269 (1969)","journal-title":"SIAM J. Appl. Math."},{"key":"862_CR7","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0167-6377(00)00061-4","volume":"27","author":"H Hoogeveen","year":"2000","unstructured":"Hoogeveen, H., Potts, C.N., Woeginger, G.J.: Online scheduling on a single machine: maximizing the number of early jobs. Oper. Res. Lett. 27, 193\u2013196 (2000)","journal-title":"Oper. Res. Lett."},{"key":"862_CR8","unstructured":"Keskinocak, P.: Online algorithms with lookahead: a survey, ISYE working paper (1999)"},{"key":"862_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","volume":"6","author":"R McNaughton","year":"1959","unstructured":"McNaughton, R.: Scheduling with deadlines and loss functions. Manag. Sci. 6, 1\u201312 (1959)","journal-title":"Manag. Sci."},{"key":"862_CR10","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0304-3975(00)00264-4","volume":"268","author":"J Noga","year":"2001","unstructured":"Noga, J., Seiden, S.S.: An optimal online algorithm for scheduling two machines with release times. Theor. Comput. Sci. 268, 133\u2013143 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"862_CR11","volume-title":"Handbook of scheduling: algorithm, model, and pertormance analysis","author":"K Pruhs","year":"2004","unstructured":"Pruhs, K., Sgall, J., Tong, E.: Online scheduling. In: Leung, J.Y.-T. (ed.) Handbook of scheduling: algorithm, model, and pertormance analysis. Chapman & Hall\/CRC Press, Boca Raton (2004)"},{"key":"862_CR12","unstructured":"Vestjens, A.P.A.: On-line machine scheduling, Ph.D. Thesis, Eindhove University of Technology, Netherlands (1997)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0862-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0862-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0862-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:41Z","timestamp":1559409101000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0862-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,8]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["862"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0862-y","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,8]]}}}