{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,3]],"date-time":"2025-10-03T22:25:25Z","timestamp":1759530325746},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T00:00:00Z","timestamp":1314662400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2013,1]]},"DOI":"10.1007\/s11590-011-0392-1","type":"journal-article","created":{"date-parts":[[2011,8,29]],"date-time":"2011-08-29T14:44:33Z","timestamp":1314629073000},"page":"39-50","source":"Crossref","is-referenced-by-count":2,"title":["Coordinating multi-location production and customer delivery"],"prefix":"10.1007","volume":"7","author":[{"given":"Eun-Seok","family":"Kim","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Oron","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,8,30]]},"reference":[{"key":"392_CR1","volume-title":"Complex Scheduling","author":"P. Brucker","year":"2006","unstructured":"Brucker P., Knust S.: Complex Scheduling, 1st edn. Springer-Verlag, Berlin (2006)","edition":"1"},{"key":"392_CR2","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1023\/A:1023067016014","volume":"26","author":"E.D. Chajakis","year":"2003","unstructured":"Chajakis E.D., Guignard M.: Scheduling deliveries in vehicles with multiple compartments. J. Glob. Optim. 26, 43\u201378 (2003)","journal-title":"J. Glob. Optim."},{"key":"392_CR3","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1016\/S0377-2217(03)00364-3","volume":"158","author":"Y.-C. Chang","year":"2004","unstructured":"Chang Y.-C., Lee C.-Y.: Machine scheduling with job delivery coordination. Eur. J. Oper. Res. 158, 470\u2013487 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"392_CR4","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0377-2217(95)00133-6","volume":"93","author":"Z.-L. Chen","year":"1996","unstructured":"Chen Z.-L.: Scheduling and common due date assignment with earliness and tardiness costs and batch delivery costs. Eur. J. Oper. Res. 93, 49\u201360 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"392_CR5","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/opre.1080.0688","volume":"58","author":"Z.-L. Chen","year":"2010","unstructured":"Chen Z.-L.: Integrated production and outbound distribution scheduling: reviews and extensions. Oper. Res. 58, 130\u2013148 (2010)","journal-title":"Oper. Res."},{"key":"392_CR6","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0377-2217(96)00127-0","volume":"94","author":"T.C.E. Cheng","year":"1996","unstructured":"Cheng T.C.E., Gordon V.S., Kovalyov M.Y.: Single machine scheduling with batch deliveries. Eur. J. Oper. Res. 94, 277\u2013283 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"392_CR7","volume-title":"Introduction to algorithm","author":"T.H. Cormen","year":"2001","unstructured":"Cormen T.H., Leiserson C.E., Rivest R.L.: Introduction to algorithm, 2nd edn. The MIT Press, Cambridge (2001)","edition":"2"},{"key":"392_CR8","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1023\/A:1018936219150","volume":"76","author":"T. Ganesharajah","year":"1998","unstructured":"Ganesharajah T., Hall N.G., Sriskandarajah C.: Design and operational issues in AGV-served manufacturing systems. Ann. Oper. Res. 76, 109\u2013154 (1998)","journal-title":"Ann. Oper. Res."},{"key":"392_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/b137269","volume-title":"Supply chain optimization","author":"J. Geunes","year":"2005","unstructured":"Geunes J., Pardalos P.M.: Supply chain optimization, 1st edn. Springer, Berlin (2005)","edition":"1"},{"key":"392_CR10","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. Graham","year":"1979","unstructured":"Graham R.L., Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G.: Optimization and approximation in deterministic machine scheduling: a survey. Ann. Discret. Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Discret. Math."},{"key":"392_CR11","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s10479-005-6234-8","volume":"135","author":"N.G. Hall","year":"2005","unstructured":"Hall N.G., Potts C.N.: The coordination of scheduling and batch deliveries. Ann. Oper. Res. 135, 41\u201364 (2005)","journal-title":"Ann. Oper. Res."},{"key":"392_CR12","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/moor.17.1.22","volume":"17","author":"L.A. Hall","year":"1992","unstructured":"Hall L.A., Shmoys D.B.: Jackson\u2019s rule for single-machine scheduling: making a good heuristic better. Math. Oper. Res. 17, 22\u201335 (1992)","journal-title":"Math. Oper. Res."},{"key":"392_CR13","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/0377-2217(93)90239-J","volume":"70","author":"J.W. Herrmann","year":"1993","unstructured":"Herrmann J.W., Lee C-Y.: On scheduling to minimize earliness and tardiness and batch delivery costs with a common due date. Eur. J. Oper. Res. 70, 272\u2013288 (1993)","journal-title":"Eur. J. Oper. Res."},{"key":"392_CR14","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0166-218X(00)00316-4","volume":"112","author":"J. Hurnik","year":"2001","unstructured":"Hurnik J., Knust S.: Makespan minimization for flow-shop problems with transportation times and a single robot. Discrete Appl. Math. 112, 199\u2013216 (2001)","journal-title":"Discrete Appl. Math."},{"key":"392_CR15","unstructured":"Kim, E.-S., Oron, D.: Scheduling equal processing time jobs on a single machine with delivery times and costs (in submission)"},{"key":"392_CR16","doi-asserted-by":"crossref","first-page":"354","DOI":"10.15807\/jorsj.34.354","volume":"34","author":"H. Kise","year":"1991","unstructured":"Kise H.: On an automated two-machine flowshop scheduling problem with infinite buffer. J. Oper. Res. Soc. Jpn. 34, 354\u2013361 (1991)","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"392_CR17","unstructured":"Knust, S.: Shop-scheduling problems with transportation. Ph.D. thesis, Department of Mathematics and Computer Science, University of Osnabr\u00fcck (1999)"},{"key":"392_CR18","doi-asserted-by":"crossref","first-page":"1103","DOI":"10.1016\/j.cor.2010.10.012","volume":"38","author":"S.O. Krumke","year":"2011","unstructured":"Krumke S.O., Taudes A., Westphal S.: Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines. Comput. Oper. Res. 38, 1103\u20131108 (2011)","journal-title":"Comput. Oper. Res."},{"key":"392_CR19","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1002\/1099-1425(200101\/02)4:1<3::AID-JOS57>3.0.CO;2-D","volume":"4","author":"C.-Y. Lee","year":"2001","unstructured":"Lee C.-Y., Chen Z.-L.: Machine scheduling with transportation considerations. J. Sched. 4, 3\u201324 (2001)","journal-title":"J. Sched."},{"key":"392_CR20","first-page":"1","volume":"12","author":"P.L. Maggu","year":"1980","unstructured":"Maggu P.L., Das G.: On sequencing problem with transportation of jobs. Pure Appl. Math. Sci. 12, 1\u20136 (1980)","journal-title":"Pure Appl. Math. Sci."},{"key":"392_CR21","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/j.apm.2010.07.023","volume":"35","author":"M.M. Mazdeh","year":"2011","unstructured":"Mazdeh M.M., Shashaani S., Ashouri A., Hindi K.S.: Single-machine batch scheduling minimizing weighted flow times and delivery costs. Appl. Math. Model. 35, 563\u2013570 (2011)","journal-title":"Appl. Math. Model."},{"key":"392_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-5226-7","volume-title":"Financial Engineering, Supply Chain and E-commerce","author":"P.M. Pardalos","year":"2002","unstructured":"Pardalos P.M., Tsitsiringos V.: Financial Engineering, Supply Chain and E-commerce, 1st edn. Springer, Berlin (2002)","edition":"1"},{"key":"392_CR23","doi-asserted-by":"crossref","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. Oper. Res. 28, 1436\u20131441 (1980)","journal-title":"Oper. Res."},{"key":"392_CR24","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1057\/jors.1990.86","volume":"41","author":"H.I. Stern","year":"1990","unstructured":"Stern H.I., Vitner G.: Scheduling parts in a combined production-transportation work cell. J. Oper. Res. Soc. 41, 625\u2013632 (1990)","journal-title":"J. Oper. Res. Soc."},{"key":"392_CR25","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.ijpe.2009.02.005","volume":"119","author":"X. Wang","year":"2009","unstructured":"Wang X., Cheng T.C.E.: Heuristics for parallel-machine scheduling with job class setups and delivery to multiple customers. Int. J. Prod. Econ. 119, 199\u2013206 (2009)","journal-title":"Int. J. Prod. Econ."},{"key":"392_CR26","doi-asserted-by":"crossref","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 Inform. 31, 503\u2013512 (1994)","journal-title":"Acta Inform."},{"key":"392_CR27","unstructured":"Yu, W.: The two-machine flow shop problem with delays and the one-machine total tardiness problem. Ph.D. Dissertation, Eindhoven University of Technology (1996)"},{"key":"392_CR28","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0377-2217(95)00168-9","volume":"94","author":"J.A. Yuan","year":"1996","unstructured":"Yuan J.A.: A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs. Eur. J. Oper. Res. 94, 203\u2013205 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"392_CR29","doi-asserted-by":"crossref","first-page":"1057","DOI":"10.1016\/j.ejor.2006.09.059","volume":"182","author":"W. Zhong","year":"2007","unstructured":"Zhong W., Dosa Z., Tan Z.: On the machine scheduling problem with job delivery coordination. Eur. J. Oper. Res. 182, 1057\u20131072 (2007)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-011-0392-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-011-0392-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-011-0392-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T15:12:07Z","timestamp":1560525127000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-011-0392-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,30]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,1]]}},"alternative-id":["392"],"URL":"https:\/\/doi.org\/10.1007\/s11590-011-0392-1","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8,30]]}}}