Hizmet lojistiğinde iş atama ve rotalama politikaları tasarımı

dc.contributor.author Ayhan Özgür TOY
dc.contributor.author Zehra DÜZGİT
dc.contributor.author Simge ÇOBAN
dc.contributor.author Zeynep ALİBAŞOĞLU
dc.contributor.author Özlem TOK ÖZKESKİN
dc.contributor.author Mert KARAKAYA
dc.contributor.author Yücel BAYRAK
dc.date.accessioned 2025-10-22T16:05:53Z
dc.date.issued 2019
dc.description.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.
dc.identifier.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.
dc.identifier.doi 10.5505/pajes.2019.84658
dc.identifier.issn 2147-5881
dc.identifier.issn 1300-7009
dc.identifier.uri https://gcris.yasar.edu.tr/handle/123456789/10835
dc.language.iso İngilizce
dc.relation.ispartof Pamukkale University Journal of Engineering Sciences
dc.source Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi
dc.subject Matematik-Endüstri Mühendisliği
dc.title Hizmet lojistiğinde iş atama ve rotalama politikaları tasarımı
dc.type Article
dc.type Article
dspace.entity.type Publication
gdc.bip.impulseclass C5
gdc.bip.influenceclass C5
gdc.bip.popularityclass C5
gdc.coar.type text::journal::journal article
gdc.collaboration.industrial false
gdc.description.endpage 1079
gdc.description.startpage 1071
gdc.description.volume 25
gdc.identifier.openalex W2998077278
gdc.index.type TR-Dizin
gdc.oaire.accesstype GOLD
gdc.oaire.diamondjournal false
gdc.oaire.impulse 0.0
gdc.oaire.influence 2.4252307E-9
gdc.oaire.isgreen true
gdc.oaire.keywords Job routing/sequencing
gdc.oaire.keywords Mathematical modelling
gdc.oaire.keywords Mixed integer programming
gdc.oaire.keywords Job assignment
gdc.oaire.popularity 1.8357048E-9
gdc.oaire.publicfunded false
gdc.oaire.sciencefields 0211 other engineering and technologies
gdc.oaire.sciencefields 0202 electrical engineering, electronic engineering, information engineering
gdc.oaire.sciencefields 02 engineering and technology
gdc.openalex.collaboration National
gdc.openalex.fwci 0.0
gdc.openalex.normalizedpercentile 0.25
gdc.opencitations.count 1
gdc.plumx.crossrefcites 1
gdc.plumx.mendeley 3
gdc.virtual.author Toy, Ayhan Özgür
oaire.citation.endPage 1079
oaire.citation.startPage 1071
publicationissue.issueNumber 9
publicationvolume.volumeNumber 25
relation.isAuthorOfPublication 40d5f673-8a20-4e1f-b0a3-777528129295
relation.isAuthorOfPublication.latestForDiscovery 40d5f673-8a20-4e1f-b0a3-777528129295
relation.isOrgUnitOfPublication ac5ddece-c76d-476d-ab30-e4d3029dee37
relation.isOrgUnitOfPublication.latestForDiscovery ac5ddece-c76d-476d-ab30-e4d3029dee37

Files