Hizmet lojistiğinde iş atama ve rotalama politikaları tasarımı
Loading...
Date
2019
Authors
Ayhan Özgür TOY
Zehra DÜZGİT
Simge ÇOBAN
Zeynep ALİBAŞOĞLU
Özlem TOK ÖZKESKİN
Mert KARAKAYA
Yücel BAYRAK
Journal Title
Journal ISSN
Volume Title
Publisher
Open Access Color
GOLD
Green Open Access
Yes
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
BIP! Indicators
Impulse
Average
Influence
Average
Popularity
Average
Abstract
Bu çalışmada ev aletleri endüstrisinde satış sonrası teknik servisin verimliliğini arttırmayı ele almaktayız. Verimlilik ölçütü müşteri taleplerini karşılamak üzere harcanan toplam süredir. Böylece amaç satış sonrası teknik hizmetlerinde harcanan toplam çalışma saatinin en küçüklenmesidir. Öncelikle işlerin tamamlanmasındaki gecikmenin nedenlerini belirtmek üzere sistemi analiz ettik. Analiz bulgularımız neticesinde verimliliği arttırmak üzere iş atama ve iş sıralamaya odaklanmayı seçtik. Teknisyenleri işlere atayan ve her teknisyen için bir günde harcanan toplam zamanı en aza indirgeyecek şekilde rota belirleyen karışık bir tamsayı programlama modeli önerilmiştir. Bu model ile iş sürelerinin beklenen değeri için problemi çözmekteyiz. Önerdiğimiz çözüm yöntemini gösterecek bir sayısal çalışma da sunmaktayız.
Description
Keywords
Matematik-Endüstri Mühendisliği, Job routing/sequencing, Mathematical modelling, Mixed integer programming, Job assignment
Fields of Science
0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology
Citation
[1] Kovacs AA Parragh SN Doerner KF Hartl RF. “Adaptive large neighborhood search for service technician routing and scheduling problems”. Journal of Scheduling 15(5) 579-600 2012.[2] Binart S Dejax P Gendreau M Semet F. “A 2-stage method for a field service routing problem with stochastic travel and service times”. Computers & Operations Research 65 64-75 2016.[3] Mathlouti I Gendreau M Potvin J. A Metaheuristic Based on Tabu Search for Solving a Technician Routing and Scheduling Problem. Interuniversity Research Centre on Enterprise Networks Logistics and Transportation (CIRRELT) 2018a.[4] Cordeau JF Laporte G Pasin F Ropke S. “Scheduling technicians and tasks in a telecommunications company”. Journal of Scheduling 13 393-409 2010.[5] Chen X Thomas BW Hewitt M. “The technician routing problem with experience-based service times”. Omega 61 49-61 2016.[6] Damm RB Resende MGC Ronconi DP. “A biased random key genetic algorithm for the field technician scheduling problem”. Computers & Operations Research 75 49-63 2016.[7] Chen X Thomas BW Hewitt M. “Multi-period technician scheduling with experience-based service times and stochastic customers”. Computers and Operations Research 82 1-14 2017.[8] Mathlouthi I Gendreau M Potvin JY. “Mixed integer linear programming for a multi-attribute technician routing and scheduling problem”. INFOR: Information Systems and Operational Research 56(1) 33-49 2018b.[9] Pillac V Gu ́eret C Medaglia AL. “A parallel matheuristic for the technician routing and scheduling problem”. Optimization Letters 7 1525- 1535 2013.[10] Xu J Chiu SY. “Effective heuristic procedures for a field technician scheduling problem”. Journal of Heuristics 7 495-509 2001.[11] Zamorano E Stolletz R. “Branch-and-price Approaches for the Multiperiod Technician Routing and Scheduling Problem”. European Journal of Operational Research 257(1) 55-68 2017.[12] Anoshkina Y Meisel F. “Technician teaming and routing with service- cost- and fairness objectives”. Computers & Industrial Engineering 135 868-880 2019.[13] Paraskevopoulos DC Laporte G Repoussis PP Tarantilis CD. “Resource constrained routing and scheduling: Review and research prospects”. European Journal of Operational Research 263 737-754 2017.
WoS Q
Scopus Q
OpenCitations Citation Count
1
Source
Pamukkale University Journal of Engineering Sciences
Volume
25
Issue
Start Page
1071
End Page
1079
Collections
PlumX Metrics
Citations
CrossRef : 1
Captures
Mendeley Readers : 3
Google Scholar™
