{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,3]],"date-time":"2025-10-03T22:08:13Z","timestamp":1759529293853},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,2,24]],"date-time":"2015-02-24T00:00:00Z","timestamp":1424736000000},"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":[[2016,5]]},"DOI":"10.1007\/s10878-015-9841-6","type":"journal-article","created":{"date-parts":[[2015,2,23]],"date-time":"2015-02-23T09:45:34Z","timestamp":1424684734000},"page":"1569-1585","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Online integrated production\u2013distribution scheduling problems without preemption"],"prefix":"10.1007","volume":"31","author":[{"given":"Xin","family":"Feng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongxi","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feifeng","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinfeng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,24]]},"reference":[{"key":"9841_CR1","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/j.ejor.2008.12.030","volume":"200","author":"I Averbakh","year":"2010","unstructured":"Averbakh I (2010) Online integrated production-distribution scheduling problems with capacitated deliveries. Eur J Oper Res 200:377\u2013384","journal-title":"Eur J Oper Res"},{"issue":"3","key":"9841_CR2","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s10951-011-0264-7","volume":"15","author":"I Averbakh","year":"2012","unstructured":"Averbakh I, Baysan M (2012) Semi-online two-level supply chain scheduling problems. J Sched 15(3):381\u2013390","journal-title":"J Sched"},{"issue":"6","key":"9841_CR3","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1016\/j.orl.2013.10.002","volume":"41","author":"I Averbakh","year":"2013","unstructured":"Averbakh I, Baysan M (2013a) Approximation algorithm for the on-line multi-customer two-level supply chain scheduling problem. Oper Res Lett 41(6):710\u2013714","journal-title":"Oper Res Lett"},{"key":"9841_CR4","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.dam.2012.08.003","volume":"161","author":"I Averbakh","year":"2013","unstructured":"Averbakh I, Baysan M (2013b) Batching and delivery in semi-online distribution systems. Discret Appl Math 161:28\u201342","journal-title":"Discret Appl Math"},{"key":"9841_CR5","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1016\/j.ejor.2006.06.004","volume":"181","author":"I Averbakh","year":"2007","unstructured":"Averbakh I, Xue Z (2007) Online supply chain scheduling problems with preemption. Eur J Oper Res 181:500\u2013504","journal-title":"Eur J Oper Res"},{"key":"9841_CR6","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"},{"issue":"1","key":"9841_CR7","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/opre.1080.0688","volume":"58","author":"ZL Chen","year":"2010","unstructured":"Chen ZL (2010) Integrated production and outbound distribution scheduling: review and extensions. Oper Res 58(1):130\u2013148","journal-title":"Oper Res"},{"issue":"4","key":"9841_CR8","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1287\/mnsc.1040.0325","volume":"51","author":"ZL Chen","year":"2005","unstructured":"Chen ZL, Vairaktarakis GL (2005) Integrated scheduling of production-distribution operations. Manag Sci 51(4):614\u2013628","journal-title":"Manag Sci"},{"key":"9841_CR9","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1016\/j.tcs.2014.10.047","volume":"562","author":"J Fan","year":"2015","unstructured":"Fan J, Lu XW, Liu PH (2015) Integrated scheduling of production and delivery on a single machine with availability constraint. Theor Comput Sci 562:581\u2013589","journal-title":"Theor Comput Sci"},{"key":"9841_CR10","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.ijpe.2014.08.017","volume":"160","author":"S Gao","year":"2015","unstructured":"Gao S, Qi L, Lei L (2015) Integrated batch production and distribution scheduling with limited vehicle capacity. Int J Prod Econ 160:13\u201325","journal-title":"Int J Prod Econ"},{"issue":"4","key":"9841_CR11","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1287\/opre.51.4.566.16106","volume":"51","author":"NG Hall","year":"2003","unstructured":"Hall NG, Potts CN (2003) Supply chain scheduling: batching and delivery. Oper Res 51(4):566\u2013584","journal-title":"Oper Res"},{"key":"9841_CR12","doi-asserted-by":"crossref","unstructured":"Hoogeveen JA, Vestjens APA (1996) Optimal on-line algorithms for single-machine scheduling. In: Proceedings 5th international conference on integer programming and combinatorial optimization, Vancouver, British Columbia, Canada, June 3\u20135 (1996) Lecture Notes in Computer Science 1084. Springer, Berlin, pp 404\u2013414","DOI":"10.1007\/3-540-61310-2_30"},{"issue":"1","key":"9841_CR13","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1137\/S0895480196296823","volume":"13","author":"JA Hoogeveen","year":"2000","unstructured":"Hoogeveen JA, Vestjens APA (2000) A best possible online algorithm for minimizing maximum delivery time on a single machine. SIAM J Discret Math 13(1):56\u201363","journal-title":"SIAM J Discret Math"},{"key":"9841_CR14","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.cie.2014.12.021","volume":"81","author":"IS Lee","year":"2015","unstructured":"Lee IS (2015) A coordinated scheduling of production-and-delivery under dynamic delivery cost environments. Comput Ind Eng 81:22\u201335","journal-title":"Comput Ind Eng"},{"key":"9841_CR15","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"JK Lenstra","year":"1977","unstructured":"Lenstra JK, Rinnooy Kan AHG, Brucker P (1977) Complexity of machine scheduling problems. Ann Discret Math 1:343\u2013362","journal-title":"Ann Discret Math"},{"issue":"3","key":"9841_CR16","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 R, Stougie L (2003) A class of online scheduling algorithms to minimize total completion time. Oper Res Lett 31(3):232\u2013236","journal-title":"Oper Res Lett"},{"key":"9841_CR17","doi-asserted-by":"crossref","unstructured":"Lu LF, Zhang LQ, Wan L (2015) Integrated production and delivery scheduling on a serial batch machine to minimize the makespan. Theor Comput Sci. doi: 10.1016\/j.tcs.2015.01.014","DOI":"10.1016\/j.tcs.2015.01.014"},{"key":"9841_CR18","doi-asserted-by":"crossref","unstructured":"Pei J, Pardalos PM, Liu XB, Fan WJ, Yang SL (2014) Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan. Eur J Oper Res. doi: 10.1016\/j.ejor.2014.11.034","DOI":"10.1016\/j.ejor.2014.11.034"},{"key":"9841_CR19","first-page":"15.1","volume-title":"Handbook of scheduling: algorithms, models, and performance analysis","author":"K Pruhs","year":"2004","unstructured":"Pruhs K, Sgall J, Torng E (2004) On-line scheduling. In: Leung Joseph Y-T (ed) Handbook of scheduling: algorithms, models, and performance analysis. CRC Press, Florida, pp 15.1\u201315.41 (Chapter 15)"},{"issue":"6","key":"9841_CR20","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1002\/1099-1425(200011\/12)3:6<333::AID-JOS53>3.0.CO;2-8","volume":"3","author":"M Akker van den","year":"2000","unstructured":"van den Akker M, Hoogeveen H, Vakhania N (2000) Restarts can help in the online minimization of the maximum delivery time on a single machine. J Sched 3(6):333\u2013341","journal-title":"J Sched"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9841-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9841-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9841-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:25Z","timestamp":1559276605000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9841-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,24]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["9841"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9841-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,24]]}}}