{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T01:09:01Z","timestamp":1725757741556},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319037790"},{"type":"electronic","value":"9783319037806"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03780-6_9","type":"book-chapter","created":{"date-parts":[[2013,11,21]],"date-time":"2013-11-21T01:13:18Z","timestamp":1384996398000},"page":"96-105","source":"Crossref","is-referenced-by-count":0,"title":["Online Scheduling on Two Parallel Machines with Release Times and Delivery Times"],"prefix":"10.1007","author":[{"given":"Peihai","family":"Liu","sequence":"first","affiliation":[]},{"given":"Xiwen","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/0377-2217(87)90243-8","volume":"29","author":"J. Carlier","year":"1987","unstructured":"Carlier, J.: Scheduling jobs with release dates and tails on identical machines to minimize the makespan. European Journal of Operational Research\u00a029, 298\u2013306 (1987)","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"9_CR2","doi-asserted-by":"publisher","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 online setting? Operations Research Letters\u00a021(4), 165\u2013169 (1997)","journal-title":"Operations Research Letters"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/322077.322090","volume":"25","author":"M.R. Garey","year":"1978","unstructured":"Garey, M.R., Johnson, D.S.: Strong NP-completeness results: Motivation, examples and implications. Journal of the Association of Computer Machinery\u00a025, 499\u2013508 (1978)","journal-title":"Journal of the Association of Computer Machinery"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1002\/jos.103","volume":"5","author":"A. Gharbi","year":"2002","unstructured":"Gharbi, A., Haouari, M.: Minimizing makespan on parallel machines subject to release dates and delivery times. Journal of Scheduling\u00a05, 329\u2013355 (2002)","journal-title":"Journal of Scheduling"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1016\/j.cor.2005.05.012","volume":"34","author":"A. Gharbi","year":"2007","unstructured":"Gharbi, A., Haouari, M.: An approximate decomposition algorithm for scheduling on parallel machines with heads and tails. Computers & Operations Research\u00a034, 868\u2013883 (2007)","journal-title":"Computers & Operations Research"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(86)90191-8","volume":"26","author":"J. Grabowski","year":"1986","unstructured":"Grabowski, J., Nowicki, E., Zdrzalka, S.: A block approach for single-machine scheduling with release dates and due dates. European Journal of Operational Research\u00a026, 278\u2013285 (1986)","journal-title":"European Journal of Operational Research"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1109\/SFCS.1989.63468","volume-title":"Proceedings of the 30th IEEE Symposium on Foundations of Computer Science","author":"L. Hall","year":"1989","unstructured":"Hall, L., Shmoys, D.: Approximation algorithms for constrained scheduling problems. In: Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, pp. 134\u2013139. IEEE Computer Society Press, New York (1989)"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1287\/moor.17.1.22","volume":"17","author":"L. Hall","year":"1992","unstructured":"Hall, L., Shmoys, D.: Jacksons rule for single-machine scheduling: Making a good heuristic better. Mathematics of Operations Research\u00a017, 22\u201335 (1992)","journal-title":"Mathematics of Operations Research"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1023\/B:ANOR.0000030688.31785.40","volume":"129","author":"M. Haouari","year":"2004","unstructured":"Haouari, M., Gharbi, A.: Lower Bounds for Scheduling on Identical Parallel Machines with Heads and Tails. Annals of Operations Research\u00a0129, 187\u2013204 (2004)","journal-title":"Annals of Operations Research"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/S0895480196296823","volume":"13","author":"J.A. Hoogeveen","year":"2000","unstructured":"Hoogeveen, J.A., Vestjean, A.P.A.: A best possible deterministic online algorithm for minimizing maximum delivery times on a single machine. SIAM Journal on Discrete Mathematics\u00a013, 56\u201363 (2000)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"3","key":"9_CR11","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1016\/j.ejor.2009.03.028","volume":"201","author":"M. Liu","year":"2010","unstructured":"Liu, M., Chu, C., Xu, Y., Zheng, F.: An optimal online algorithm for single machine scheduling with bounded delivery times. European Journal of Operational Research\u00a0201(3), 693\u2013700 (2010)","journal-title":"European Journal of Operational Research"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1023\/A:1026272526225","volume":"6","author":"M. Mastrolilli","year":"2003","unstructured":"Mastrolilli, M.: Efficient approximation schemes for scheduling problems with release dates and delivery times. Journal of Scheduling\u00a06, 521\u2013531 (2003)","journal-title":"Journal of Scheduling"},{"issue":"1","key":"9_CR13","doi-asserted-by":"publisher","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. Theoretical Computer Science\u00a0268(1), 133\u2013143 (2001)","journal-title":"Theoretical Computer Science"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"1436","DOI":"10.1287\/opre.28.6.1436","volume":"28","author":"C.N. Potts","year":"1980","unstructured":"Potts, C.N.: Analysis of a heuristic for one machine sequencing with release dates and delivery times. Operations Research\u00a028, 1436\u20131441 (1980)","journal-title":"Operations Research"},{"issue":"2","key":"9_CR15","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S0167-6377(01)00115-8","volume":"30","author":"L. Stougie","year":"2002","unstructured":"Stougie, L., Vestjens, A.P.A.: Randomized on-line scheduling: How low can\u2019t you go? Operations Research Letters\u00a030(2), 89\u201396 (2002)","journal-title":"Operations Research Letters"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.tcs.2007.11.006","volume":"393","author":"J. Tian","year":"2008","unstructured":"Tian, J., Fu, R., Yuan, J.: A best on-line algorithm for single machine scheduling with small delivery times. Theoretical Computer Science\u00a0393, 287\u2013293 (2008)","journal-title":"Theoretical Computer Science"},{"key":"9_CR17","unstructured":"Vestjens, A.P.A.: Online Machine Scheduling. Ph.D. Thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands (1997)"},{"issue":"6","key":"9_CR18","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/BF01213203","volume":"31","author":"G.J. Woeginger","year":"1994","unstructured":"Woeginger, G.J.: Heuristics for parallel machine scheduling with delivery times. Acta Informatica\u00a031(6), 503\u2013512 (1994)","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03780-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T08:39:44Z","timestamp":1558687184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03780-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319037790","9783319037806"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03780-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}