{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T02:27:01Z","timestamp":1767925621973,"version":"3.49.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,5,30]],"date-time":"2014-05-30T00:00:00Z","timestamp":1401408000000},"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 Heuristics"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s10732-014-9249-y","type":"journal-article","created":{"date-parts":[[2014,5,29]],"date-time":"2014-05-29T12:16:49Z","timestamp":1401365809000},"page":"511-537","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Scheduling parallel machines with single vehicle delivery"],"prefix":"10.1007","volume":"20","author":[{"given":"Eray","family":"Cakici","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Scott J.","family":"Mason","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H. Neil","family":"Geismar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John W.","family":"Fowler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,5,30]]},"reference":[{"key":"9249_CR1","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1007\/11893295_61","volume":"4234","author":"DE Akyol","year":"2006","unstructured":"Akyol, D.E., Bayhan, G.M.: Minimizing makespan on identical parallel machines using neural networks. Lect. Notes Comput. Sci. 4234, 553\u2013562 (2006)","journal-title":"Lect. Notes Comput. Sci."},{"key":"9249_CR2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0166-218X(93)90085-3","volume":"47","author":"S Albers","year":"1993","unstructured":"Albers, S., Brucker, P.: The complexity of one-machine batching problems. Discrete. Appl. Math. 47, 87\u2013107 (1993)","journal-title":"Discrete. Appl. Math."},{"key":"9249_CR3","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/S0360-8352(01)00009-2","volume":"39","author":"M Azizoglu","year":"2001","unstructured":"Azizoglu, M., Webster, S.: Scheduling a batch processing machine with incompatible job families. Comput. Ind. Eng. 39, 325\u2013335 (2001)","journal-title":"Comput. Ind. Eng."},{"key":"9249_CR4","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1016\/j.asoc.2011.10.015","volume":"12","author":"J Behnamian","year":"2012","unstructured":"Behnamian, J., Fatemi Ghomi, S.M.T.: Minimizing makespan on a three-machine flowshop batch scheduling problem with transportation using genetic algorithm. Appl. Soft Comput. 12, 768\u2013777 (2012)","journal-title":"Appl. Soft Comput."},{"key":"9249_CR5","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/361011.361064","volume":"17","author":"L Bruno","year":"1974","unstructured":"Bruno, L., Coffman, E.G., Sethi, J.R.: Scheduling independent tasks to reduce mean finishing time. Commun. ACM. 17, 382\u2013387 (1974)","journal-title":"Commun. ACM."},{"key":"9249_CR6","doi-asserted-by":"crossref","first-page":"2462","DOI":"10.1080\/00207543.2012.748227","volume":"51","author":"E Cakici","year":"2013","unstructured":"Cakici, E., Mason, S.J., Fowler, J.W., Geismar, H.N.: Batch scheduling on parallel machines with dynamic job arrivals and incompatible job families. Int. J. Prod. Res. 51, 2462\u20132477 (2013)","journal-title":"Int. J. Prod. Res."},{"key":"9249_CR7","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1016\/S0377-2217(03)00364-3","volume":"158","author":"YC 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":"9249_CR8","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1016\/j.ejor.2006.11.047","volume":"187","author":"B Chen","year":"2008","unstructured":"Chen, B., Lee, C.: Logistics scheduling with batching and transportation. Eur. J. Oper. Res. 187, 871\u2013876 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"9249_CR9","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1287\/opre.1070.0412","volume":"55","author":"ZL Chen","year":"2007","unstructured":"Chen, Z.L., Hall, N.G.: Supply chain scheduling: conflict and cooperation in assembly systems. Oper. Res. 55, 1072\u20131089 (2007)","journal-title":"Oper. Res."},{"key":"9249_CR10","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1287\/mnsc.1040.0325","volume":"51","author":"ZL Chen","year":"2005","unstructured":"Chen, Z.L., Vairaktarakis, G.L.: Integrated scheduling of production and distribution operations. Manag. Sci. 51, 614\u2013628 (2005)","journal-title":"Manag. Sci."},{"key":"9249_CR11","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1111\/j.1937-5956.2006.tb00243.x","volume":"15","author":"M Dawande","year":"2006","unstructured":"Dawande, M., Geismar, H.N., Hall, N.G., Sriskandarajah, C.: Supply chain scheduling: distribution systems. Prod. Oper. Manag. 15, 243\u2013261 (2006)","journal-title":"Prod. Oper. Manag."},{"key":"9249_CR12","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1287\/opre.49.1.52.11189","volume":"49","author":"G Dobson","year":"2001","unstructured":"Dobson, G., Nambimadom, R.S.: The batch loading and scheduling problem. Oper. Res. 49, 52\u201365 (2001)","journal-title":"Oper. Res."},{"key":"9249_CR13","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1287\/ijoc.1060.0208","volume":"20","author":"HN Geismar","year":"2008","unstructured":"Geismar, H.N., Laporte, G., Lei, L., Sriskandarajah, C.: The integrated production and transportation scheduling problem for a product with a short lifespan. INFORMS J. Comput. 20, 21\u201333 (2008)","journal-title":"INFORMS J. Comput."},{"key":"9249_CR14","unstructured":"Gonga, H., Tanga, L., Duinb, C.W.: A two stage flowshop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times. Comput. Oper. Res. 37, 960\u2013969 (2010)"},{"key":"9249_CR15","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K.: Optimization and approximation in deterministic machine scheduling: a survey. Ann. Discrete Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Discrete Math."},{"key":"9249_CR16","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1287\/opre.1070.0398","volume":"55","author":"NG Hall","year":"2007","unstructured":"Hall, N.G., Posner, M.E.: Performance prediction and pre-selection for optimization and heuristic solution procedures. Oper. Res. 55, 703\u2013716 (2007)","journal-title":"Oper. Res."},{"key":"9249_CR17","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1287\/opre.51.4.566.16106","volume":"51","author":"NG Hall","year":"2003","unstructured":"Hall, N.G., Potts, C.N.: Supply chain scheduling: batching and delivery. Oper. Res. 51, 566\u2013584 (2003)","journal-title":"Oper. Res."},{"key":"9249_CR18","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s10479-005-6234-8","volume":"135","author":"NG 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":"9249_CR19","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1016\/j.ejor.2004.07.011","volume":"167","author":"H Hoogeveen","year":"2005","unstructured":"Hoogeveen, H.: Multi-criteria scheduling \u2014 invited review. Eur. J. Oper. 167, 592\u2013623 (2005)","journal-title":"Eur. J. Oper."},{"key":"9249_CR20","volume-title":"Factory Physics","author":"W Hopp","year":"2000","unstructured":"Hopp, W., Spearman, M.: Factory Physics. McGraw Hill, New York (2000)"},{"key":"9249_CR21","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1016\/j.ejor.2005.09.006","volume":"176","author":"M Ji","year":"2007","unstructured":"Ji, M., He, Y., Cheng, T.C.E.: Batch delivery scheduling with batch delivery cost on a single machine. Eur. J. Oper. Res. 176, 745\u2013755 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"9249_CR22","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/S0167-6377(01)00072-4","volume":"29","author":"GJ Kyparisis","year":"2001","unstructured":"Kyparisis, G.J., Koulamas, C.: A note on weighted completion time minimization in a flexible flow shop. Oper. Res. Lett. 29, 5\u201311 (2001)","journal-title":"Oper. Res. Lett."},{"key":"9249_CR23","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.ijpe.2004.10.001","volume":"98","author":"SG Koh","year":"2005","unstructured":"Koh, S.G., Koo, P.H., Kim, D.C., Hur, W.S.: Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families. Int. J. Prod. Econ. 98, 81\u201396 (2005)","journal-title":"Int. J. Prod. Econ."},{"key":"9249_CR24","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":"CY 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":"9249_CR25","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1016\/j.cie.2011.05.005","volume":"61","author":"D Lei","year":"2011","unstructured":"Lei, D., Wang, T.: An effective neighborhood search algorithm for scheduling a flowshop of batch processing machines. Comput. Ind. Eng. 61, 739\u2013743 (2011)","journal-title":"Comput. Ind. Eng."},{"key":"9249_CR26","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"JK Lenstra","year":"1977","unstructured":"Lenstra, J.K., Rinnooy Kan, A.H.G., Brucker, P.: Complexity of machine scheduling problems. Ann. Discrete Math. 1, 343\u2013362 (1977)","journal-title":"Ann. Discrete Math."},{"key":"9249_CR27","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.ejor.2003.11.022","volume":"164","author":"CL Li","year":"2005","unstructured":"Li, C.L., Vairaktarakis, G.L., Lee, C.Y.: Machine scheduling with deliveries to multiple customer locations. Eur. J. Oper. Res. 164, 39\u201351 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"9249_CR28","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.ejor.2006.09.087","volume":"183","author":"MM Mazdeh","year":"2007","unstructured":"Mazdeh, M.M., Sarhadi, M., Hindi, K.S.: A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs. Eur. J. Oper. Res. 183, 74\u201386 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"9249_CR29","volume-title":"Integer and Combinatorial Optimization","author":"GL Nemhauser","year":"1998","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1998)"},{"key":"9249_CR30","doi-asserted-by":"crossref","first-page":"2843","DOI":"10.3923\/jas.2008.2843.2850","volume":"8","author":"B Naderi","year":"2008","unstructured":"Naderi, B., Khalili, M., Taghavifard, M.T., Roshanaei, V.: A variable neighborhood search for hybrid flexible flowshops with setup times minimizing total completion time. J. Appl. Sci. 8, 2843\u20132850 (2008)","journal-title":"J. Appl. Sci."},{"key":"9249_CR31","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/S0377-2217(99)00153-8","volume":"120","author":"CN Potts","year":"2000","unstructured":"Potts, C.N., Kovalyov, M.Y.: Scheduling with batching: A review. Eur. J. Oper. Res. 120, 228\u2013249 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"9249_CR32","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1002\/nav.20078","volume":"52","author":"X Qi","year":"2005","unstructured":"Qi, X.: A logistics scheduling model: inventory cost reduction by batching. Naval Res. Logist. 52, 312\u2013320 (2005)","journal-title":"Naval Res. Logist."},{"issue":"Part A","key":"9249_CR33","first-page":"17","volume":"147","author":"E Selvarajah","year":"2014","unstructured":"Selvarajah, E., Zhang, R.: Supply chain scheduling at the manufacturer to minimize inventory holding and delivery costs. Int. J. Prod. Econ. 147(Part A), 17\u2013124 (2014)","journal-title":"Int. J. Prod. Econ."},{"key":"9249_CR34","volume-title":"Designing and Managing the Supply Chain","author":"D Simchi-Levi","year":"2003","unstructured":"Simchi-Levi, D., Kaminski, P., Simchi-Levi, E.: Designing and Managing the Supply Chain. McGraw Hill, New York (2003)"},{"key":"9249_CR35","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1016\/j.cie.2008.07.022","volume":"56","author":"L Tang","year":"2009","unstructured":"Tang, L., Liu, P.: Flowshop scheduling problems with transportation or deterioration between the batching and single machines. Comput. Ind. Eng. 56, 1289\u20131295 (2009)","journal-title":"Comput. Ind. Eng."},{"key":"9249_CR36","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.1080\/00207549408957026","volume":"32","author":"R Uzsoy","year":"1994","unstructured":"Uzsoy, R.: Scheduling a single batch processing machine with non-identical job sizes. Int. J. Prod. Res. 32, 1615\u20131635 (1994)","journal-title":"Int. J. Prod. Res."},{"key":"9249_CR37","doi-asserted-by":"crossref","first-page":"2685","DOI":"10.1080\/00207549508904839","volume":"33","author":"R Uzsoy","year":"1995","unstructured":"Uzsoy, R.: Scheduling batch processing machines with incompatible job families. Int. J. Prod. Res. 33, 2685\u20132708 (1995)","journal-title":"Int. J. Prod. Res."},{"key":"9249_CR38","unstructured":"Van Buer, M.G., Woodruff, D.L., Olson, R.T.: Solving the medium newspaper production\/distribution problem. Eur. J. Oper. Res. 115, 237\u2013253 (1999)"},{"key":"9249_CR39","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0925-5273(99)00105-X","volume":"68","author":"G Wang","year":"2000","unstructured":"Wang, G., Cheng, T.C.E.: Parallel machine scheduling with batch delivery costs. Int. J. Prod. Econ. 68, 177\u2013183 (2000)","journal-title":"Int. J. Prod. Econ."},{"key":"9249_CR40","volume-title":"Integer Programming","author":"LA Wolsey","year":"1998","unstructured":"Wolsey, L.A.: Integer Programming. Wiley, New York (1998)"},{"key":"9249_CR41","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, G., 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":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-014-9249-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-014-9249-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-014-9249-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:54:34Z","timestamp":1559242474000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-014-9249-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,30]]},"references-count":41,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["9249"],"URL":"https:\/\/doi.org\/10.1007\/s10732-014-9249-y","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,30]]}}}