The coordinated production and transportation scheduling problem with a time-sensitive product: a branch-and-cut algorithm

Basit Öğe Kaydı
dc.contributor.authorKaraoglan, Ismail
dc.contributor.authorKesen, Saadettin Erhan
dc.date.accessioned2020-03-26T19:42:49Z
dc.date.available2020-03-26T19:42:49Z
dc.date.issued2017
dc.departmentSelçuk Üniversitesien_US
dc.description.abstractIn many supply chain scenarios in which short lifespan products are considered, production and transportation decisions must be made in a coordinated manner with no inventory stage. Hence, a solution to this problem conveys information about production starting times of each product lot at facility and delivery times of the lots to various customer-sites located in different geographic regions. In this paper, we study a variant of the problem that single product with limited shelf life is produced at single facility. Once produced, production lot is directly distributed to the customers with non-ignorable transportation time by single vehicle having limited capacity before the lifespan. Objective is to determine the minimum time required to produce and deliver all customer demands. To this end, we develop a branch-and-cut (B&C) algorithm using several valid inequalities adopted from the existing literature to improve lower bounds and applying a local search based on simulated annealing approach to improve upper bounds. On test problems available in the literature, we evaluate the performance of the B&C algorithm. Results show the promising performance of the B&C algorithm.en_US
dc.identifier.doi10.1080/00207543.2016.1213916en_US
dc.identifier.endpage557en_US
dc.identifier.issn0020-7543en_US
dc.identifier.issn1366-588Xen_US
dc.identifier.issue2en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage536en_US
dc.identifier.urihttps://dx.doi.org/10.1080/00207543.2016.1213916
dc.identifier.urihttps://hdl.handle.net/20.500.12395/35530
dc.identifier.volume55en_US
dc.identifier.wosWOS:000390417200014en_US
dc.identifier.wosqualityQ1en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherTAYLOR & FRANCIS LTDen_US
dc.relation.ispartofINTERNATIONAL JOURNAL OF PRODUCTION RESEARCHen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.selcuk20240510_oaigen_US
dc.subjectsupply chain coordinationen_US
dc.subjectvehicle routing problemen_US
dc.subjectschedulingen_US
dc.subjectbranch-and-cut algorithmen_US
dc.subjecttime-sensitive producten_US
dc.titleThe coordinated production and transportation scheduling problem with a time-sensitive product: a branch-and-cut algorithmen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu