{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:26:48Z","timestamp":1753601208946,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031355097"},{"type":"electronic","value":"9783031355103"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-35510-3_13","type":"book-chapter","created":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T12:01:48Z","timestamp":1685534508000},"page":"120-131","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Heuristics Assisted by\u00a0Machine Learning for\u00a0the\u00a0Integrated Production Planning and\u00a0Distribution Problem"],"prefix":"10.1007","author":[{"given":"Matheus","family":"de Freitas Araujo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 Elias Claudio","family":"Arroyo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thiago Henrique","family":"Nogueira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,1]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","unstructured":"Chen, Z.L.: Integrated production and distribution operations. Handbook of quantitative supply chain analysis. 74, 711\u2013745 (2004) https:\/\/doi.org\/10.1007\/978-1-4020-7953-5_17","DOI":"10.1007\/978-1-4020-7953-5_17"},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1287\/opre.1080.0688","volume":"58","author":"ZL Chen","year":"2010","unstructured":"Chen, Z.L.: Integrated production and outbound distribution scheduling: review and extensions. Oper. Res. 58(1), 130\u2013148 (2010)","journal-title":"Oper. Res."},{"key":"13_CR3","unstructured":"Felix, G.P., Arroyo, J.E.C.: Heur\u00edsticas para o sequenciamento da produ\u00e7\u00e3o e roteamento de ve\u00edculos com frota heterog\u00eanea. LII Simp\u00f3sio Brasileiro de Pesquisa Operacional 52"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Hofmann, E., R\u00fcsch, M.: Industry 4.0 and the current status as well as future prospects on logistics. Comput. Ind. 89, pp. 23-34 (2017)","DOI":"10.1016\/j.compind.2017.04.002"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Hou, Y., Fu, Y., Gao, K., Zhang, H., Sadollah, A.: modelling and optimization of integrated distributed flow shop scheduling and distribution problems with time windows. Expert Syst. Appl. 187, 115827 (2021)","DOI":"10.1016\/j.eswa.2021.115827"},{"key":"13_CR6","unstructured":"Kingma, D.P., Ba, J.: Adam: a method for stochastic optimization (2014). CoRR abs\/1412.6980"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Kurdi, M.: A memetic algorithm with novel semi-constructive evolution operators for permutation flow shop scheduling problem. Appl. Soft Comput. 94, 106458 (2020)","DOI":"10.1016\/j.asoc.2020.106458"},{"issue":"1","key":"13_CR8","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10732-019-09420-1","volume":"26","author":"L Liu","year":"2020","unstructured":"Liu, L., Li, W., Li, K., Zou, X.: A coordinated production and transportation scheduling problem with minimum sum of order delivery times. J. Heuristics 26(1), 33\u201358 (2020)","journal-title":"J. Heuristics"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Mao, J.Y., Pan, Q.K., Miao, Z.H., Gao, L.: An effective multi-start iterated greedy algorithm to minimize make span for the distributed permutation flow shop scheduling problem with preventive maintenance. Expert Syst. Appl. 169, 114495 (2021)","DOI":"10.1016\/j.eswa.2020.114495"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Martins, L.D.C., Gonzalez-Neira, E.M., Hatami, S., Juan, A.A., Montoya-Torres, J.R.: Combining production and distribution in supply chains: the hybrid flow-shop vehicle routing problem. Comput. Ind. Eng. 159, 107486 (2021)","DOI":"10.1016\/j.cie.2021.107486"},{"issue":"3","key":"13_CR11","first-page":"155","volume":"7","author":"M Nagano","year":"2022","unstructured":"Nagano, M., Tomazella, C., Tavares-Neto, R., Abreu, L.: Solution methods for the integrated permutation flow shop and vehicle routing problem. J. Proj. Manage. 7(3), 155\u2013166 (2022)","journal-title":"J. Proj. Manage."},{"issue":"1","key":"13_CR12","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz, M., Enscore, E.E., Jr., Ham, I.: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11(1), 91\u201395 (1983)","journal-title":"Omega"},{"issue":"11","key":"13_CR13","doi-asserted-by":"publisher","first-page":"1877","DOI":"10.1016\/j.cor.2009.06.014","volume":"37","author":"SU Ngueveu","year":"2010","unstructured":"Ngueveu, S.U., Prins, C., Calvo, R.W.: An effective memetic algorithm for the cumulative capacitated vehicle routing problem. Comput. Oper. Res. 37(11), 1877\u20131885 (2010)","journal-title":"Comput. Oper. Res."},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Pan, Q.K., Gao, L., Wang, L., Liang, J., Li, X.Y.: Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flow shop problem. Expert Syst. Appl. 124 (2019)","DOI":"10.1016\/j.eswa.2019.01.062"},{"issue":"3","key":"13_CR15","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1016\/j.cor.2011.05.005","volume":"39","author":"GM Ribeiro","year":"2012","unstructured":"Ribeiro, G.M., Laporte, G.: An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem. Comput. Oper. Res. 39(3), 728\u2013735 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"13_CR16","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254\u2013265 (1987)","journal-title":"Oper. Res."},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Ta, Q.C., Billaut, J.C., Bouquard, J.L.: Heuristic algorithms to minimize the total tardiness in a flow shop production and outbound distribution scheduling problem. In: 2015 International conference on industrial engineering and systems management (IESM), pp. 128\u2013134 (2015)","DOI":"10.1109\/IESM.2015.7380147"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Tamannaei, M., Rasti-Barzoki, M.: Mathematical programming and solution approaches for minimizing tardiness and transportation costs in the supply chain scheduling problem. Comput. Ind. Eng. 127, 643\u2013656 (2019)","DOI":"10.1016\/j.cie.2018.11.003"},{"issue":"12","key":"13_CR19","doi-asserted-by":"publisher","first-page":"8917","DOI":"10.1007\/s00500-019-04420-6","volume":"24","author":"S Wang","year":"2020","unstructured":"Wang, S., Wu, R., Chu, F., Yu, J.: Variable neighborhood search-based methods for integrated hybrid flow shop scheduling with distribution. Soft Comput. 24(12), 8917\u20138936 (2020)","journal-title":"Soft Comput."},{"key":"13_CR20","unstructured":"Zar, J.H.: Biostatistical analysis. 4th. New Jersey, USA, p. 929 (1999)"},{"issue":"2","key":"13_CR21","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1504\/IJBIC.2020.106443","volume":"15","author":"X Zhang","year":"2020","unstructured":"Zhang, X., Li, X.T., Yin, M.H.: An enhanced genetic algorithm for the distributed assembly permutation flow shop scheduling problem. Int. J. Bio-Inspired Comput. 15(2), 113\u2013124 (2020)","journal-title":"Int. J. Bio-Inspired Comput."},{"issue":"15","key":"13_CR22","doi-asserted-by":"publisher","first-page":"5005","DOI":"10.1080\/00207543.2017.1378955","volume":"56","author":"X Zou","year":"2018","unstructured":"Zou, X., Liu, L., Li, K., Li, W.: A coordinated algorithm for integrated production scheduling and vehicle routing problem. Int. J. Prod. Res. 56(15), 5005\u20135024 (2018)","journal-title":"Int. J. Prod. Res."}],"container-title":["Lecture Notes in Networks and Systems","Intelligent Systems Design and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-35510-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,21]],"date-time":"2024-10-21T15:29:56Z","timestamp":1729524596000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-35510-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031355097","9783031355103"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-35510-3_13","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"type":"print","value":"2367-3370"},{"type":"electronic","value":"2367-3389"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"1 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISDA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Systems Design and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isda2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.mirlabs.net\/isda22\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}