{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T03:08:09Z","timestamp":1781665689300,"version":"3.54.5"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,7,23]],"date-time":"2022-07-23T00:00:00Z","timestamp":1658534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,7,23]],"date-time":"2022-07-23T00:00:00Z","timestamp":1658534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001773","name":"University of New South Wales","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001773","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2022,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In supply chain literature, production coordination and vehicle routing have received a lot of attention. Even though all functions in the supply chain are interrelated, they are normally handled independently. This disconnected approach might lead to less-than-ideal outcomes. Increasing total efficiency by integrating manufacturing and delivery scheduling processes is popular. This study focuses on synchronic production\u2013distribution scheduling difficulties, particularly permutation flow shop scheduling in production and sequence-dependent setup time (SDST) and vehicle routing alternatives in distribution. To create a cost-effective distribution among the placement of geographically separated clients and hence to minimize delivery costs, batch delivery to customers employing a succession of homogenized capacity limitation vehicles is examined here. However, this might result in the failure to complete multiple client orders before their deadlines, raising the cost of lateness. As a result, the goal of this study is to lower the overall cost of tardiness and batch distribution in the supply chain. To accomplish so, a mixed-integer nonlinear programming model is developed, and the model is solved using a suggested genetic algorithm (GA). Because there is no established benchmark for this issue, a set of genuine problem scenarios is created in order to assess the proposed GA in a viable and difficult environment. Ruiz's benchmark data, which is derived from Taillard's benchmark cases of permutation flow shops, was supplemented with SDSTs in the production of test examples. In comparison to an exact method, the results show that the proposed GA can rapidly seek solutions to optimality for most small-sized instances. Furthermore, for medium and large-scale cases, the proposed GA continues to work well and produces solutions in a fair amount of time in comparison to GA without the local search.<\/jats:p>","DOI":"10.1007\/s12293-022-00372-x","type":"journal-article","created":{"date-parts":[[2022,7,23]],"date-time":"2022-07-23T08:05:02Z","timestamp":1658563502000},"page":"355-376","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["Optimization of integrated production scheduling and vehicle routing problem with batch delivery to multiple customers in supply chain"],"prefix":"10.1007","volume":"14","author":[{"given":"Tanzila","family":"Azad","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Humyun Fuad","family":"Rahman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ripon K.","family":"Chakrabortty","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael J.","family":"Ryan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,7,23]]},"reference":[{"key":"372_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105861","author":"I Abu Doush","year":"2019","unstructured":"Abu Doush I, Al-Betar MA, Awadallah MA, Santos E, Hammouri AI, Mafarjeh M, AlMeraj Z (2019) Flow shop scheduling with blocking using modified harmony search algorithm with neighboring heuristics methods. Appl Soft Comput J. https:\/\/doi.org\/10.1016\/j.asoc.2019.105861","journal-title":"Appl Soft Comput J"},{"issue":"1","key":"372_CR2","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.ijpe.2013.07.001","volume":"146","author":"P Amorim","year":"2013","unstructured":"Amorim P, Belo-Filho MAF, Toledo FMB, Almeder C, Almada-Lobo B (2013) Lot sizing versus batching in the production and distribution planning of perishable goods. Int J Prod Econ 146(1):208\u2013218. https:\/\/doi.org\/10.1016\/j.ijpe.2013.07.001","journal-title":"Int J Prod Econ"},{"issue":"3","key":"372_CR3","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1007\/s43069-021-00087-8","volume":"2","author":"E Behmanesh","year":"2021","unstructured":"Behmanesh E, Pannek J (2021) A comparison between memetic algorithm and genetic algorithm for an integrated logistics network with flexible delivery path. Op Res Forum 2(3):871. https:\/\/doi.org\/10.1007\/s43069-021-00087-8","journal-title":"Op Res Forum"},{"issue":"20","key":"372_CR4","doi-asserted-by":"publisher","first-page":"6040","DOI":"10.1080\/00207543.2015.1010744","volume":"53","author":"MAF Belo-Filho","year":"2015","unstructured":"Belo-Filho MAF, Amorim P, Almada-Lobo B (2015) An adaptive large neighbourhood search for the operational integrated production and distribution problem of perishable products. Int J Prod Res 53(20):6040\u20136058. https:\/\/doi.org\/10.1080\/00207543.2015.1010744","journal-title":"Int J Prod Res"},{"issue":"2","key":"372_CR5","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1016\/S0377-2217(03)00364-3","volume":"158","author":"YC Chang","year":"2004","unstructured":"Chang YC, Lee CY (2004) Machine scheduling with job delivery coordination. Eur J Oper Res 158(2):470\u2013487. https:\/\/doi.org\/10.1016\/S0377-2217(03)00364-3","journal-title":"Eur J Oper Res"},{"issue":"4","key":"372_CR6","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1080\/0305215X.2013.786062","volume":"46","author":"YC Chang","year":"2014","unstructured":"Chang YC, Li VC, Chiang CJ (2014) An ant colony optimization heuristic for an integrated production and distribution scheduling problem. Eng Optim 46(4):503\u2013520. https:\/\/doi.org\/10.1080\/0305215X.2013.786062","journal-title":"Eng Optim"},{"issue":"4","key":"372_CR7","doi-asserted-by":"publisher","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 and distribution operations. Manage Sci 51(4):614\u2013628. https:\/\/doi.org\/10.1287\/mnsc.1040.0325","journal-title":"Manage Sci"},{"issue":"3","key":"372_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2480741.2480752","volume":"45","author":"M Crepinsek","year":"2013","unstructured":"Crepinsek M, Liu SH, Mernik M (2013) Exploration and exploitation in evolutionary algorithms: a survey. ACM Comput Surv 45(3):1\u201333. https:\/\/doi.org\/10.1145\/2480741.2480752","journal-title":"ACM Comput Surv"},{"key":"372_CR9","doi-asserted-by":"publisher","first-page":"8131","DOI":"10.1109\/ACCESS.2017.2693030","volume":"5","author":"MA Dulebenets","year":"2017","unstructured":"Dulebenets MA, Moses R, Ozguven EE, Vanli A (2017) Minimizing carbon dioxide emissions due to container handling at marine container terminals via hybrid evolutionary algorithms. IEEE Access 5:8131\u20138147. https:\/\/doi.org\/10.1109\/ACCESS.2017.2693030","journal-title":"IEEE Access"},{"issue":"1","key":"372_CR10","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/s10696-011-9125-0","volume":"24","author":"P Farahani","year":"2012","unstructured":"Farahani P, Grunow M, G\u00fcnther HO (2012) Integrated production and distribution planning for perishable food products. Flex Serv Manuf J 24(1):28\u201351. https:\/\/doi.org\/10.1007\/s10696-011-9125-0","journal-title":"Flex Serv Manuf J"},{"issue":"1","key":"372_CR11","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.ejor.2003.11.022","volume":"164","author":"CL Li","year":"2005","unstructured":"Li CL, Vairaktarakis G, Lee CY (2005) Machine scheduling with deliveries to multiple customer locations. Eur J Op Res 164(1):39\u201351. https:\/\/doi.org\/10.1016\/j.ejor.2003.11.022","journal-title":"Eur J Op Res"},{"issue":"2","key":"372_CR12","doi-asserted-by":"publisher","first-page":"81","DOI":"10.3390\/MATH8020146","volume":"8","author":"L Liu","year":"2020","unstructured":"Liu L, Liu S (2020) Integrated production and distribution problem of perishable products with a minimum total order weighted delivery time. Mathematics 8(2):81. https:\/\/doi.org\/10.3390\/MATH8020146","journal-title":"Mathematics"},{"key":"372_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.06.063","author":"Z Liu","year":"2018","unstructured":"Liu Z, Wang Y, Huang P (2018) AnD: A many-objective evolutionary algorithm with angle-based selection and shift-based density estimation. Inf Sci. https:\/\/doi.org\/10.1016\/j.ins.2018.06.063","journal-title":"Inf Sci"},{"key":"372_CR14","doi-asserted-by":"publisher","unstructured":"Moons S, Ramaekers K, Caris A, and Arda Y (2016) Integrating production scheduling and vehicle routing decisions at the operational decision level\u202f: a review and discussion Research group Logistics , Hasselt University , Campus Diepenbeek , Agoralaan Building D , 3590 Diepenbeek , Belgium QuantOM , HEC . Computers and Industrial Engineering. doi: https:\/\/doi.org\/10.1016\/j.cie.2016.12.010","DOI":"10.1016\/j.cie.2016.12.010"},{"issue":"2","key":"372_CR15","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1080\/00401706.1992.10484904","volume":"34","author":"VN Nair","year":"1992","unstructured":"Nair VN (1992) Taguchis parameter design: a panel discussion. Technometrics 34(2):127\u2013161. https:\/\/doi.org\/10.1080\/00401706.1992.10484904","journal-title":"Technometrics"},{"key":"372_CR16","doi-asserted-by":"publisher","first-page":"101047","DOI":"10.1016\/j.swevo.2022.101047","volume":"70","author":"E Osaba","year":"2022","unstructured":"Osaba E, Del Ser J, Cotta C, Moscato P (2022) Editorial: memetic computing: accelerating optimization heuristics with problem-dependent local search methods. Swarm Evol Comput 70:101047. https:\/\/doi.org\/10.1016\/j.swevo.2022.101047","journal-title":"Swarm Evol Comput"},{"issue":"5","key":"372_CR17","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1080\/09511920802527590","volume":"22","author":"YB Park","year":"2009","unstructured":"Park YB, Hong SC (2009) Integrated production and distribution planning for single-period inventory products. Int J Comput Integr Manuf 22(5):443\u2013457. https:\/\/doi.org\/10.1080\/09511920802527590","journal-title":"Int J Comput Integr Manuf"},{"issue":"2","key":"372_CR18","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s12293-021-00329-6","volume":"13","author":"H Qin","year":"2021","unstructured":"Qin H, Li T, Teng Y, Wang K (2021) Integrated production and distribution scheduling in distributed hybrid flow shops. Memetic Comput 13(2):185\u2013202. https:\/\/doi.org\/10.1007\/s12293-021-00329-6","journal-title":"Memetic Comput"},{"key":"372_CR19","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cie.2015.08.006","volume":"90","author":"HF Rahman","year":"2015","unstructured":"Rahman HF, Sarker R, Essam D (2015) A genetic algorithm for permutation flow shop scheduling under make to stock production system. Comput Ind Eng 90:12\u201324. https:\/\/doi.org\/10.1016\/j.cie.2015.08.006","journal-title":"Comput Ind Eng"},{"issue":"2","key":"372_CR20","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1016\/j.ejor.2015.06.018","volume":"247","author":"HF Rahman","year":"2015","unstructured":"Rahman HF, Sarker R, Essam D (2015) A real-time order acceptance and scheduling approach for permutation flow shop problems. Eur J Op Res 247(2):488\u2013503. https:\/\/doi.org\/10.1016\/j.ejor.2015.06.018","journal-title":"Eur J Op Res"},{"issue":"5\u20138","key":"372_CR21","doi-asserted-by":"publisher","first-page":"2781","DOI":"10.1007\/s00170-018-2146-z","volume":"97","author":"HF Rahman","year":"2018","unstructured":"Rahman HF, Sarker R, Essam D (2018) Multiple-order permutation flow shop scheduling under process interruptions. Int J Adv Manuf Technol 97(5\u20138):2781\u20132808. https:\/\/doi.org\/10.1007\/s00170-018-2146-z","journal-title":"Int J Adv Manuf Technol"},{"issue":"9","key":"372_CR22","doi-asserted-by":"publisher","first-page":"865","DOI":"10.3390\/sym11091145","volume":"11","author":"S Rani","year":"2019","unstructured":"Rani S, Suri B, Goyal R (2019) On the effectiveness of using elitist genetic algorithm in mutation testing. Symmetry 11(9):865. https:\/\/doi.org\/10.3390\/sym11091145","journal-title":"Symmetry"},{"key":"372_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115535","volume":"184","author":"I Ribas","year":"2021","unstructured":"Ribas I, Companys R, Tort-Martorell X (2021) An iterated greedy algorithm for the parallel blocking flow shop scheduling problem and sequence-dependent setup times. Expert Syst Appl 184:115535. https:\/\/doi.org\/10.1016\/j.eswa.2021.115535","journal-title":"Expert Syst Appl"},{"issue":"2","key":"372_CR24","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.ejor.2004.04.017","volume":"165","author":"R Ruiz","year":"2005","unstructured":"Ruiz R, Maroto C (2005) A comprehensive review and evaluation of permutation flowshop heuristics. Eur J Op Res 165(2):479\u2013494. https:\/\/doi.org\/10.1016\/j.ejor.2004.04.017","journal-title":"Eur J Op Res"},{"issue":"1","key":"372_CR25","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.ejor.2004.01.022","volume":"165","author":"R Ruiz","year":"2005","unstructured":"Ruiz R, Maroto C, Alcaraz J (2005) Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics. Eur J Op Res 165(1):34\u201354. https:\/\/doi.org\/10.1016\/j.ejor.2004.01.022","journal-title":"Eur J Op Res"},{"key":"372_CR26","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.eswa.2015.12.001","volume":"51","author":"W Shao","year":"2016","unstructured":"Shao W, Pi D (2016) A self-guided differential evolution with neighborhood search for permutation flow shop scheduling. Expert Syst Appl 51:161\u2013176. https:\/\/doi.org\/10.1016\/j.eswa.2015.12.001","journal-title":"Expert Syst Appl"},{"issue":"2","key":"372_CR27","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Op Res 64(2):278\u2013285. https:\/\/doi.org\/10.1016\/0377-2217(93)90182-M","journal-title":"Eur J Op Res"},{"key":"372_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107240","author":"O Theophilus","year":"2021","unstructured":"Theophilus O, Dulebenets MA, Pasha J, Lauyip Y, Fathollahi-Fard A, Mazaheri M (2021) Truck scheduling optimization at a cold-chain cross-docking terminal with product perishability considerations. Computers Indus Eng. https:\/\/doi.org\/10.1016\/j.cie.2021.107240","journal-title":"Computers Indus Eng"},{"issue":"2","key":"372_CR29","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1057\/jors.2012.184","volume":"65","author":"A Toptal","year":"2014","unstructured":"Toptal A, Koc U, Sabuncuoglu I (2014) A joint production and transportation planning problem with heterogeneous vehicles. J Op Res Soc 65(2):180\u2013196. https:\/\/doi.org\/10.1057\/jors.2012.184","journal-title":"J Op Res Soc"},{"issue":"1","key":"372_CR30","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.ejor.2012.11.049","volume":"227","author":"CA Ullrich","year":"2013","unstructured":"Ullrich CA (2013) Integrated machine scheduling and vehicle routing with time windows. Eur J Op Res 227(1):152\u2013165. https:\/\/doi.org\/10.1016\/j.ejor.2012.11.049","journal-title":"Eur J Op Res"},{"issue":"4","key":"372_CR31","doi-asserted-by":"publisher","first-page":"1350","DOI":"10.1016\/j.cor.2006.08.016","volume":"35","author":"E Vallada","year":"2008","unstructured":"Vallada E, Ruiz R, Minella G (2008) Minimising total tardiness in the m-machine flowshop problem: a review and evaluation of heuristics and metaheuristics. Comput Op Res 35(4):1350\u20131373. https:\/\/doi.org\/10.1016\/j.cor.2006.08.016","journal-title":"Comput Op Res"},{"key":"372_CR32","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.cie.2015.09.007","volume":"90","author":"K Wang","year":"2015","unstructured":"Wang K, Choi SH, Lu H (2015) A hybrid estimation of distribution algorithm for simulation-based scheduling in a stochastic permutation flowshop. Comput Ind Eng 90:186\u2013196. https:\/\/doi.org\/10.1016\/j.cie.2015.09.007","journal-title":"Comput Ind Eng"},{"issue":"10","key":"372_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TSMC.2018.2869510","volume":"48","author":"K Wang","year":"2018","unstructured":"Wang K, Luo H, Liu F, Yue X (2018) Delivery to multiple customers in supply chains. IEEE Trans Syst, Man, Cybern: Syst 48(10):1\u201312","journal-title":"IEEE Trans Syst, Man, Cybern: Syst"},{"key":"372_CR34","doi-asserted-by":"publisher","DOI":"10.3390\/su12062426","author":"S Xiong","year":"2020","unstructured":"Xiong S, Feng Y, Huang K (2020) Optimal MTS and MTO hybrid production system for a single product under the cap-and-trade environment. Sustainability (Switzerland). https:\/\/doi.org\/10.3390\/su12062426","journal-title":"Sustainability (Switzerland)"},{"key":"372_CR35","doi-asserted-by":"publisher","first-page":"106342","DOI":"10.1016\/j.cie.2020.106342","volume":"142","author":"E Ya\u011fmur","year":"2020","unstructured":"Ya\u011fmur E, Kesen SE (2020) A memetic algorithm for joint production and distribution scheduling with due dates. Computers Indus Eng 142:106342. https:\/\/doi.org\/10.1016\/j.cie.2020.106342","journal-title":"Computers Indus Eng"},{"issue":"195","key":"372_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2019.08.069","volume":"509","author":"H Zhao","year":"2020","unstructured":"Zhao H, Zhang C (2020) An online-learning-based evolutionary many-objective algorithm. Inf Sci 509(195):1\u201321. https:\/\/doi.org\/10.1016\/j.ins.2019.08.069","journal-title":"Inf Sci"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-022-00372-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12293-022-00372-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-022-00372-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,6]],"date-time":"2022-08-06T05:20:21Z","timestamp":1659763221000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12293-022-00372-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,23]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["372"],"URL":"https:\/\/doi.org\/10.1007\/s12293-022-00372-x","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,23]]},"assertion":[{"value":"11 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 July 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose. The authors have no conflicts of interest to declare relevant to this article's content. All authors certify that they have no affiliations with or involvement in any organization or entity with any financial interest or non-financial interest in the subject matter or materials discussed in this manuscript. The authors have no financial or proprietary interests in any material discussed in this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}