{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:18:36Z","timestamp":1743045516065,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031436116"},{"type":"electronic","value":"9783031436123"}],"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-43612-3_27","type":"book-chapter","created":{"date-parts":[[2023,9,6]],"date-time":"2023-09-06T03:30:04Z","timestamp":1693971004000},"page":"437-449","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Operational Integration of Supply Chain Activities with Earliness and Tardiness Considerations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5865-3483","authenticated-orcid":false,"given":"Ece","family":"Ya\u011fmur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9994-5458","authenticated-orcid":false,"given":"Saadettin Erhan","family":"Kesen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,7]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.cie.2016.05.020","volume":"98","author":"M Afzalirad","year":"2016","unstructured":"Afzalirad, M., Rezaeian, J.: Resource-constrained unrelated parallel machine scheduling problem with sequence dependent setup times, precedence constraints and machine eligibility restrictions. Comput. Ind. Eng. 98, 40\u201352 (2016). https:\/\/doi.org\/10.1016\/j.cie.2016.05.020","journal-title":"Comput. Ind. Eng."},{"issue":"4","key":"27_CR2","doi-asserted-by":"publisher","first-page":"1369","DOI":"10.5267\/j.ijdns.2022.5.014","volume":"6","author":"H Alzoubi","year":"2022","unstructured":"Alzoubi, H., Alshurideh, M., Kurdi, B., Alhyasat, K., Ghazal, T.: The effect of e-payment and online shopping on sales growth: evidence from banking industry. Int. J. Data Netw. Sci. 6(4), 1369\u20131380 (2022). https:\/\/doi.org\/10.5267\/j.ijdns.2022.5.014","journal-title":"Int. J. Data Netw. Sci."},{"issue":"20","key":"27_CR3","doi-asserted-by":"publisher","first-page":"6040","DOI":"10.1080\/00207543.2015.1010744","volume":"53","author":"M Belo-Filho","year":"2015","unstructured":"Belo-Filho, M., Amorim, P., Almada-Lobo, B.: An adaptive large neighbourhood search for the operational integrated production and distribution problem of perishable products. Int. J. Prod. Res. 53(20), 6040\u20136058 (2015). https:\/\/doi.org\/10.1080\/00207543.2015.1010744","journal-title":"Int. J. Prod. Res."},{"key":"27_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2022.12.036","author":"L Berghman","year":"2023","unstructured":"Berghman, L., Kergosien, Y., Billaut, J.-C.: A review on integrated scheduling and outbound vehicle routing problems. Eur. J. Oper. Res. (2023). https:\/\/doi.org\/10.1016\/j.ejor.2022.12.036","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"27_CR5","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1080\/0305215X.2013.786062","volume":"46","author":"Y-C Chang","year":"2014","unstructured":"Chang, Y.-C., Li, V.C., Chiang, C.-J.: An ant colony optimization heuristic for an integrated production and distribution scheduling problem. Eng. Optim. 46(4), 503\u2013520 (2014). https:\/\/doi.org\/10.1080\/0305215X.2013.786062","journal-title":"Eng. Optim."},{"key":"27_CR6","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, H.-O.: Integrated production and distribution planning for perishable food products. Flex. Serv. Manuf. J. 24, 28\u201351 (2012). https:\/\/doi.org\/10.1007\/s10696-011-9125-0","journal-title":"Flex. Serv. Manuf. J."},{"key":"27_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2020.120824","volume":"259","author":"M Ganji","year":"2020","unstructured":"Ganji, M., Kazemipoor, H., Molana, S.M.H., Sajadi, S.M.: A green multi-objective integrated scheduling of production and distribution with heterogeneous fleet vehicle routing and time windows. J. Clean. Prod. 259, 120824 (2020). https:\/\/doi.org\/10.1016\/j.jclepro.2020.120824","journal-title":"J. Clean. Prod."},{"key":"27_CR8","unstructured":"Gavish, B., Graves, S.C.: The travelling salesman problem and related problems (1978). http:\/\/hdl.handle.net\/1721.1\/5363"},{"issue":"6","key":"27_CR9","doi-asserted-by":"publisher","first-page":"1874","DOI":"10.1080\/00207543.2021.1876941","volume":"60","author":"P He","year":"2022","unstructured":"He, P., Li, K., Kumar, P.R.: An enhanced branch-and-price algorithm for the integrated production and transportation scheduling problem. Int. J. Prod. Res. 60(6), 1874\u20131889 (2022). https:\/\/doi.org\/10.1080\/00207543.2021.1876941","journal-title":"Int. J. Prod. Res."},{"key":"27_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115827","volume":"187","author":"Y Hou","year":"2022","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 (2022). https:\/\/doi.org\/10.1016\/j.eswa.2021.115827","journal-title":"Expert Syst. Appl."},{"key":"27_CR11","doi-asserted-by":"publisher","unstructured":"Kesen, S.E., Bekta\u015f, T.: Integrated production scheduling and distribution planning with time windows. Lean Green Supply Chain Manage: Optim. Models Algorithms, 231\u2013252 (2019).https:\/\/doi.org\/10.1007\/978-3-319-97511-5_8","DOI":"10.1007\/978-3-319-97511-5_8"},{"issue":"21","key":"27_CR12","doi-asserted-by":"publisher","first-page":"6615","DOI":"10.1080\/00207543.2020.1821927","volume":"59","author":"H Liu","year":"2021","unstructured":"Liu, H., Guo, Z., Zhang, Z.: A hybrid multi-level optimisation framework for integrated production scheduling and vehicle routing with flexible departure time. Int. J. Prod. Res. 59(21), 6615\u20136632 (2021). https:\/\/doi.org\/10.1080\/00207543.2020.1821927","journal-title":"Int. J. Prod. Res."},{"key":"27_CR13","doi-asserted-by":"publisher","unstructured":"Louren\u00e7o, H.R., Martin, O.C., St\u00fctzle, T., Iterated local search. In: Handbook of Metaheuristics, pp. 320\u2013353. Springer, Cham (2003). https:\/\/doi.org\/10.1007\/0-306-48056-5_11","DOI":"10.1007\/0-306-48056-5_11"},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/j.ijpe.2019.05.017","volume":"219","author":"S Mohammadi","year":"2020","unstructured":"Mohammadi, S., Al-e-Hashem, S.M., Rekik, Y.: An integrated production scheduling and delivery route planning with multi-purpose machines: a case study from a furniture manufacturing company. Int. J. Prod. Econ. 219, 347\u2013359 (2020). https:\/\/doi.org\/10.1016\/j.ijpe.2019.05.017","journal-title":"Int. J. Prod. Econ."},{"issue":"2","key":"27_CR15","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10732-011-9186-y","volume":"19","author":"PHV Penna","year":"2013","unstructured":"Penna, P.H.V., Subramanian, A., Ochi, L.S.: An iterated local search heuristic for the heterogeneous fleet vehicle routing problem. J. Heuristics 19(2), 201\u2013232 (2013). https:\/\/doi.org\/10.1007\/s10732-011-9186-y","journal-title":"J. Heuristics"},{"key":"27_CR16","unstructured":"St\u00fctzle, T.: Applying iterated local search to the permutation flow shop problem. Technical Report AIDA-98\u201304, FG Intellektik, TU Darmstadt (1998)"},{"issue":"3","key":"27_CR17","doi-asserted-by":"publisher","first-page":"1519","DOI":"10.1016\/j.ejor.2005.01.066","volume":"174","author":"T St\u00fctzle","year":"2006","unstructured":"St\u00fctzle, T.: Iterated local search for the quadratic assignment problem. Eur. J. Oper. Res. 174(3), 1519\u20131539 (2006). https:\/\/doi.org\/10.1016\/j.ejor.2005.01.066","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"27_CR18","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.ejor.2012.11.049","volume":"227","author":"CA Ullrich","year":"2013","unstructured":"Ullrich, C.A.: Integrated machine scheduling and vehicle routing with time windows. Eur. J. Oper. Res. 227(1), 152\u2013165 (2013). https:\/\/doi.org\/10.1016\/j.ejor.2012.11.049","journal-title":"Eur. J. Oper. Res."},{"issue":"12","key":"27_CR19","doi-asserted-by":"publisher","first-page":"3281","DOI":"10.1016\/j.cor.2009.03.008","volume":"36","author":"P Vansteenwegen","year":"2009","unstructured":"Vansteenwegen, P., Souffriau, W., Berghe, G.V., Van Oudheusden, D.: Iterated local search for the team orienteering problem with time windows. Comput. Oper. Res. 36(12), 3281\u20133290 (2009). https:\/\/doi.org\/10.1016\/j.cor.2009.03.008","journal-title":"Comput. Oper. Res."},{"key":"27_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109191","volume":"125","author":"G-H Wu","year":"2022","unstructured":"Wu, G.-H., Cheng, C.-Y., Pourhejazy, P., Fang, B.-L.: Variable neighborhood-based cuckoo search for production routing with time window and setup times. Appl. Soft. Comput. 125, 109191 (2022). https:\/\/doi.org\/10.1016\/j.asoc.2022.109191","journal-title":"Appl. Soft. Comput."},{"key":"27_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106342","volume":"142","author":"E Ya\u011fmur","year":"2020","unstructured":"Ya\u011fmur, E., Kesen, S.E.: A memetic algorithm for joint production and distribution scheduling with due dates. Comput. Ind. Eng. 142, 106342 (2020). https:\/\/doi.org\/10.1016\/j.cie.2020.106342","journal-title":"Comput. Ind. Eng."},{"key":"27_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107649","volume":"161","author":"E Ya\u011fmur","year":"2021","unstructured":"Ya\u011fmur, E., Kesen, S.E.: Multi-trip heterogeneous vehicle routing problem coordinated with production scheduling: memetic algorithm and simulated annealing approaches. Comput. Ind. Eng. 161, 107649 (2021). https:\/\/doi.org\/10.1016\/j.cie.2021.107649","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"27_CR23","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1080\/00207543.2021.2017054","volume":"61","author":"E Ya\u011fmur","year":"2023","unstructured":"Ya\u011fmur, E., Kesen, S.E.: Bi-objective coordinated production and transportation scheduling problem with sustainability: formulation and solution approaches. Int. J. Prod. Res. 61(3), 774\u2013795 (2023). https:\/\/doi.org\/10.1080\/00207543.2021.2017054","journal-title":"Int. J. Prod. Res."}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43612-3_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,6]],"date-time":"2023-09-06T03:33:04Z","timestamp":1693971184000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43612-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031436116","9783031436123"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43612-3_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"7 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Logistics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Berlin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccl22023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccl2023.uni-hamburg.de\/en.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"71","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,42","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}