Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.14365/2051
Full metadata record
DC FieldValueLanguage
dc.contributor.authorÖzpeynirci, Özgür-
dc.contributor.authorAglamaz, Ebru-
dc.date.accessioned2023-06-16T14:31:17Z-
dc.date.available2023-06-16T14:31:17Z-
dc.date.issued2016-
dc.identifier.issn0969-6016-
dc.identifier.issn1475-3995-
dc.identifier.urihttps://doi.org/10.1111/itor.12204-
dc.identifier.urihttps://hdl.handle.net/20.500.14365/2051-
dc.description.abstractIn this study, we define the pharmacy duty scheduling problem, which requires a subset of pharmacies to be on duty on national holidays, at weekends, and at nights, in order to be able to satisfy the emergency medicine needs. We model the pharmacy duty scheduling problem as a multiperiod p-median problem with special side constraints, and analyze the computational complexity. We propose a Tabu Search heuristic and develop lower bound (LB) algorithms. We test the performance of mathematical models, Tabu Search heuristic, and the LBs on randomly generated instances. We analyze the current system in. Izmir, the third largest city in Turkey, with a population of 3.5 million, and apply solution methods. Our results show that the proposed Tabu Search algorithm suggests improvements on the current system.en_US
dc.description.sponsorshipScientific and Technological Research Council of Turkey (TUBITAK) [3501-111M107]; TUBITAK [2219]en_US
dc.description.sponsorshipThe first author acknowledges the support of the Scientific and Technological Research Council of Turkey (TUBITAK), grant number 3501-111M107. During some part of this research, the first author was a visiting researcher at Ecole Centrale Paris and funded by TUBITAK, 2219 programme. The second author acknowledges TUBITAK scholarship.en_US
dc.language.isoenen_US
dc.publisherWileyen_US
dc.relation.ispartofInternatıonal Transactıons in Operatıonal Researchen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectpharmacy duty schedulingen_US
dc.subjectmultiperiod p-median problemen_US
dc.subjectTabu searchen_US
dc.subjectTabu Search Approachen_US
dc.subjectNeighborhood Searchen_US
dc.subjectStation Locationen_US
dc.subjectAlgorithmen_US
dc.subjectErrorsen_US
dc.titlePharmacy duty scheduling problemen_US
dc.typeArticleen_US
dc.identifier.doi10.1111/itor.12204-
dc.identifier.scopus2-s2.0-84954402287en_US
dc.departmentİzmir Ekonomi Üniversitesien_US
dc.authoridÖzpeynirci, Özgür/0000-0002-3695-6587-
dc.authorwosidÖzpeynirci, Özgür/A-2796-2009-
dc.authorscopusid16402801100-
dc.authorscopusid56830598300-
dc.identifier.volume23en_US
dc.identifier.issue3en_US
dc.identifier.startpage459en_US
dc.identifier.endpage480en_US
dc.identifier.wosWOS:000368144400005en_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.identifier.scopusqualityQ1-
dc.identifier.wosqualityQ2-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextreserved-
item.fulltextWith Fulltext-
item.languageiso639-1en-
item.openairetypeArticle-
crisitem.author.dept03.05. Logistics Management-
Appears in Collections:Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection
Files in This Item:
File SizeFormat 
2051.pdf
  Restricted Access		633.65 kBAdobe PDFView/Open    Request a copy
Show simple item record



CORE Recommender

SCOPUSTM   
Citations

6
checked on Nov 20, 2024

WEB OF SCIENCETM
Citations

5
checked on Nov 20, 2024

Page view(s)

134
checked on Nov 25, 2024

Download(s)

6
checked on Nov 25, 2024

Google ScholarTM

Check




Altmetric


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