Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.13091/4768
Full metadata record
DC FieldValueLanguage
dc.contributor.authorYağmur, E.-
dc.contributor.authorKesen, S.E.-
dc.date.accessioned2023-11-11T09:03:40Z-
dc.date.available2023-11-11T09:03:40Z-
dc.date.issued2023-
dc.identifier.isbn9783031436116-
dc.identifier.issn0302-9743-
dc.identifier.urihttps://doi.org/10.1007/978-3-031-43612-3_27-
dc.identifier.urihttps://hdl.handle.net/20.500.13091/4768-
dc.descriptionProceedings of the 14th International Conferences on Computational Logistics, ICCL 2023 -- 6 September 2023 through 8 September 2023 -- -- 300429en_US
dc.description.abstractThe operational integration of the production and distribution activities in a supply chain requires concurrent consideration of two major problems known as production scheduling and vehicle routing. While the production environment of the integrated problem under study consists of identical parallel machines, the distribution environment has a limited number of homogeneous vehicles that deliver completed orders to customers. The objective function is to minimize the sum of total earliness and tardiness according to the time windows specified by each customer. In this paper, we first describe the integrated problem as a Mixed Integer Programming (MIP) model and subsequently present an Iterated Local Search (ILS) algorithm to find optimal or near-optimal solutions in a reasonable time. The performance of the ILS is evaluated against the MIP-based solutions obtained by applying a standard solver like CPLEX. According to the computational findings, the suggested ILS can find optimal or near optimal solutions for randomly generated test instances in just a few seconds. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.en_US
dc.language.isoenen_US
dc.publisherSpringer Science and Business Media Deutschland GmbHen_US
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)en_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectearlinessen_US
dc.subjectiterated local searchen_US
dc.subjectparallel machine schedulingen_US
dc.subjecttardinessen_US
dc.subjectvehicle routingen_US
dc.subjectInteger programmingen_US
dc.subjectLocal search (optimization)en_US
dc.subjectOptimal systemsen_US
dc.subjectProduction controlen_US
dc.subjectSupply chainsen_US
dc.subjectVehiclesen_US
dc.subjectEarlinessen_US
dc.subjectEarliness and tardinessen_US
dc.subjectIterated local searchen_US
dc.subjectNear-optimal solutionsen_US
dc.subjectOperational integrationen_US
dc.subjectParallel machines schedulingen_US
dc.subjectProduction environmentsen_US
dc.subjectProduction Schedulingen_US
dc.subjectProduction vehiclesen_US
dc.subjectTardinessen_US
dc.subjectVehicle routingen_US
dc.titleOperational Integration of Supply Chain Activities with Earliness and Tardiness Considerationsen_US
dc.typeConference Objecten_US
dc.identifier.doi10.1007/978-3-031-43612-3_27-
dc.identifier.scopus2-s2.0-85172295160en_US
dc.departmentKTÜNen_US
dc.identifier.volume14239 LNCSen_US
dc.identifier.startpage437en_US
dc.identifier.endpage449en_US
dc.identifier.wosWOS:001158863600027en_US
dc.institutionauthor-
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.authorscopusid57214825234-
dc.authorscopusid55918231100-
dc.identifier.scopusqualityQ3-
item.fulltextNo Fulltext-
item.openairetypeConference Object-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextnone-
item.cerifentitytypePublications-
item.languageiso639-1en-
Appears in Collections:Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collections
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collections
Show simple item record



CORE Recommender

Page view(s)

8
checked on May 13, 2024

Google ScholarTM

Check




Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.