{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:05:55Z","timestamp":1761293155501},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T00:00:00Z","timestamp":1402358400000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1007\/s10878-014-9760-y","type":"journal-article","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T18:55:44Z","timestamp":1402426544000},"page":"347-359","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Online scheduling on two parallel machines with release dates and delivery times"],"prefix":"10.1007","volume":"30","author":[{"given":"Peihai","family":"Liu","sequence":"first","affiliation":[]},{"given":"Xiwen","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,6,10]]},"reference":[{"key":"9760_CR1","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/0377-2217(87)90243-8","volume":"29","author":"J Carlier","year":"1987","unstructured":"Carlier J (1987) Scheduling jobs with release dates and tails on identical machines to minimize the makespan. Eur J Oper Res 29:298\u2013306","journal-title":"Eur J Oper Res"},{"issue":"4","key":"9760_CR2","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 APA (1997) Scheduling on identical machines: how good is LPT in an online setting? Oper Res Lett 21(4):165\u2013169","journal-title":"Oper Res Lett"},{"key":"9760_CR3","doi-asserted-by":"crossref","unstructured":"Garey MR, Johnson DS (1978) Strong NP-completeness results: motivation, examples and implications. J Assoc Comput Mach 25:499\u2013508","DOI":"10.1145\/322077.322090"},{"key":"9760_CR4","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1002\/jos.103","volume":"5","author":"A Gharbi","year":"2002","unstructured":"Gharbi A, Haouari M (2002) Minimizing makespan on parallel machines subject to release dates and delivery times. J Sched 5:329\u2013355","journal-title":"J Sched"},{"key":"9760_CR5","doi-asserted-by":"crossref","first-page":"868","DOI":"10.1016\/j.cor.2005.05.012","volume":"34","author":"A Gharbi","year":"2007","unstructured":"Gharbi A, Haouari M (2007) An approximate decomposition algorithm for scheduling on parallel machines with heads and tails. Comput Oper Res 34:868\u2013883","journal-title":"Comput Oper Res"},{"key":"9760_CR6","doi-asserted-by":"crossref","unstructured":"Hall L, Shmoys D (1989) Approximation algorithms for constrained scheduling problems. In: Proceedings of the 30th IEEE symposium on foundations of computer science. IEEE Computer Society Press, New York, pp 134\u2013139","DOI":"10.1109\/SFCS.1989.63468"},{"key":"9760_CR7","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/moor.17.1.22","volume":"17","author":"L Hall","year":"1992","unstructured":"Hall L, Shmoys D (1992) Jacksons rule for single-machine scheduling: making a good heuristic better. Math Oper Res 17:22\u201335","journal-title":"Math Oper Res"},{"key":"9760_CR8","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1023\/B:ANOR.0000030688.31785.40","volume":"129","author":"M Haouari","year":"2004","unstructured":"Haouari M, Gharbi A (2004) Lower bounds for scheduling on identical parallel machines with heads and tails. Ann Oper Res 129:187\u2013204","journal-title":"Ann Oper Res"},{"key":"9760_CR9","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1137\/S0895480196296823","volume":"13","author":"JA Hoogeveen","year":"2000","unstructured":"Hoogeveen JA, Vestjean APA (2000) A best possible deterministic online algorithm for minimizing maximum delivery times on a single machine. SIAM J Discret Math 13:56\u201363","journal-title":"SIAM J Discret Math"},{"issue":"2","key":"9760_CR10","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s10878-007-9102-4","volume":"17","author":"I Kacem","year":"2009","unstructured":"Kacem I (2009) Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval. J Comb Optim 17(2):117\u2013133","journal-title":"J Comb Optim"},{"issue":"3","key":"9760_CR11","doi-asserted-by":"crossref","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 (2010) An optimal online algorithm for single machine scheduling with bounded delivery times. Eur J Oper Res 201(3):693\u2013700","journal-title":"Eur J Oper Res"},{"key":"9760_CR12","doi-asserted-by":"crossref","unstructured":"Liu P, Lu X (2014) Online unbounded batch scheduling on parallel machines with delivery times. J Comb Optim. doi: 10.1007\/s10878-014-9706-4","DOI":"10.1007\/s10878-014-9706-4"},{"key":"9760_CR13","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1023\/A:1026272526225","volume":"6","author":"M Mastrolilli","year":"2003","unstructured":"Mastrolilli M (2003) Efficient approximation schemes for scheduling problems with release dates and delivery times. J Sched 6:521\u2013531","journal-title":"J Sched"},{"issue":"1","key":"9760_CR14","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 (2001) An optimal online algorithm for scheduling two machines with release times. Theor Comput Sci 268(1):133\u2013143","journal-title":"Theor Comput Sci"},{"key":"9760_CR15","doi-asserted-by":"crossref","first-page":"1436","DOI":"10.1287\/opre.28.6.1436","volume":"28","author":"CN Potts","year":"1980","unstructured":"Potts CN (1980) Analysis of a heuristic for one machine sequencing with release dates and delivery times. Oper Res 28:1436\u20131441","journal-title":"Oper Res"},{"issue":"4","key":"9760_CR16","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1023\/A:1009875403874","volume":"3","author":"S Seiden","year":"1999","unstructured":"Seiden S (1999) Randomized online scheduling with delivery times. J Comb Optim 3(4):399\u2013416","journal-title":"J Comb Optim"},{"issue":"2","key":"9760_CR17","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0167-6377(01)00115-8","volume":"30","author":"L Stougie","year":"2002","unstructured":"Stougie L, Vestjens APA (2002) Randomized on-line scheduling: how low can\u2019t you go? Oper Res Lett 30(2):89\u201396","journal-title":"Oper Res Lett"},{"key":"9760_CR18","doi-asserted-by":"crossref","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 (2008) A best on-line algorithm for single machine scheduling with small delivery times. Theor Comput Sci 393:287\u2013293","journal-title":"Theor Comput Sci"},{"key":"9760_CR19","unstructured":"Vestjens APA (1997) Online Machine Scheduling. Ph.D. Thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands"},{"issue":"6","key":"9760_CR20","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/BF01213203","volume":"31","author":"GJ Woeginger","year":"1994","unstructured":"Woeginger GJ (1994) Heuristics for parallel machine scheduling with delivery times. Acta Inform 31(6):503\u2013512","journal-title":"Acta Inform"},{"key":"9760_CR21","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/s10878-007-9108-y","volume":"17","author":"J Yuan","year":"2009","unstructured":"Yuan J, Li S, Tian J, Fu R (2009) A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times. J Comb, Optim 17:206\u2013213","journal-title":"J Comb, Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9760-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9760-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9760-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:23Z","timestamp":1559262203000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9760-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,10]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["9760"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9760-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,10]]}}}