A sequential workforce scheduling and routing problem for the retail industry: a case study

Basit Öğe Kaydı
dc.contributor.authorÖzcan, Sel
dc.contributor.authorUğurlu, Onur
dc.contributor.authorEliiyi, Uğur
dc.date.accessioned2023-03-22T19:48:03Z
dc.date.available2023-03-22T19:48:03Z
dc.date.issued2022
dc.departmentBelirleneceken_US
dc.description.abstractThis study investigated the operational workforce scheduling and routing problem of a leading international retail company. Currently, the company plans to launch a new product into the Turkish market, which will be used in all its retail stores across the country. For the best marketing outcome, branding of all retail stores needs to be renewed by an outsourced workforce with a minimum of cost and time. We framed this as a workforce scheduling and routing optimization problem. Therefore, a two-stage solution was proposed. The retail stores were partitioned into disjoint regions in the first stage, and the schedules were optimized in the second stage. We employed the k-means clustering algorithm for constructing these regions. Two different heuristic approaches were applied to solve regional scheduling in the second stage of the algorithm since the resulting scheduling problem is NP-hard. Finally, a computational analysis was performed with real data and the results are discussed.en_US
dc.identifier.doi10.26650/JTL.2022.1096085
dc.identifier.endpage498en_US
dc.identifier.issn2459-1718
dc.identifier.issue2en_US
dc.identifier.startpage479en_US
dc.identifier.trdizinid1155623en_US
dc.identifier.urihttps://hdl.handle.net/20.500.14034/960
dc.identifier.urihttps://doi.org/10.26650/JTL.2022.1096085
dc.identifier.urihttps://search.trdizin.gov.tr/yayin/detay/1155623
dc.identifier.volume7en_US
dc.indekslendigikaynakTR-Dizinen_US
dc.language.isoenen_US
dc.relation.journalJournal of Transportation and Logisticsen_US
dc.relation.publicationcategoryMakale - Ulusal Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectWorkforce Scheduling and Routingen_US
dc.subjectInteger Programmingen_US
dc.subjectHeuristicsen_US
dc.titleA sequential workforce scheduling and routing problem for the retail industry: a case studyen_US
dc.typeArticleen_US

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim
İsim:
uğur eliiyi.pdf
Boyut:
877.52 KB
Biçim:
Adobe Portable Document Format
Açıklama:
Tam metin / Full text
İndir

Koleksiyon

TR-Dizin İndeksli Yayınlar Koleksiyonu
İşletme Bölümü Koleksiyonu