Pharmacy duty scheduling problem
| dc.contributor.author | Özpeynirci, Özgür | |
| dc.contributor.author | Aglamaz, Ebru | |
| dc.date.accessioned | 2023-06-16T14:31:17Z | |
| dc.date.available | 2023-06-16T14:31:17Z | |
| dc.date.issued | 2016 | |
| dc.description.abstract | In 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.sponsorship | Scientific and Technological Research Council of Turkey (TUBITAK) [3501-111M107]; TUBITAK [2219] | en_US |
| dc.description.sponsorship | The 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.identifier.doi | 10.1111/itor.12204 | |
| dc.identifier.issn | 0969-6016 | |
| dc.identifier.issn | 1475-3995 | |
| dc.identifier.scopus | 2-s2.0-84954402287 | |
| dc.identifier.uri | https://doi.org/10.1111/itor.12204 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.14365/2051 | |
| dc.language.iso | en | en_US |
| dc.publisher | Wiley | en_US |
| dc.relation.ispartof | Internatıonal Transactıons in Operatıonal Research | en_US |
| dc.rights | info:eu-repo/semantics/closedAccess | en_US |
| dc.subject | pharmacy duty scheduling | en_US |
| dc.subject | multiperiod p-median problem | en_US |
| dc.subject | Tabu search | en_US |
| dc.subject | Tabu Search Approach | en_US |
| dc.subject | Neighborhood Search | en_US |
| dc.subject | Station Location | en_US |
| dc.subject | Algorithm | en_US |
| dc.subject | Errors | en_US |
| dc.title | Pharmacy duty scheduling problem | en_US |
| dc.type | Article | en_US |
| dspace.entity.type | Publication | |
| gdc.author.id | Özpeynirci, Özgür/0000-0002-3695-6587 | |
| gdc.author.scopusid | 16402801100 | |
| gdc.author.scopusid | 56830598300 | |
| gdc.author.wosid | Özpeynirci, Özgür/A-2796-2009 | |
| gdc.bip.impulseclass | C5 | |
| gdc.bip.influenceclass | C5 | |
| gdc.bip.popularityclass | C4 | |
| gdc.coar.access | metadata only access | |
| gdc.coar.type | text::journal::journal article | |
| gdc.collaboration.industrial | false | |
| gdc.description.department | İEÜ, İşletme Fakültesi, Lojistik Yönetimi Bölümü | en_US |
| gdc.description.departmenttemp | [Özpeynirci, Özgür] Izmir Univ Econ, Dept Logist Management, Izmir, Turkey; [Aglamaz, Ebru] Adnan Menderes Univ, Dept Tourism Management, Aydin, Turkey | en_US |
| gdc.description.endpage | 480 | en_US |
| gdc.description.issue | 3 | en_US |
| gdc.description.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
| gdc.description.scopusquality | Q1 | |
| gdc.description.startpage | 459 | en_US |
| gdc.description.volume | 23 | en_US |
| gdc.description.wosquality | Q2 | |
| gdc.identifier.openalex | W1831233558 | |
| gdc.identifier.wos | WOS:000368144400005 | |
| gdc.index.type | WoS | |
| gdc.index.type | Scopus | |
| gdc.oaire.diamondjournal | false | |
| gdc.oaire.downloads | 3 | |
| gdc.oaire.impulse | 1.0 | |
| gdc.oaire.influence | 2.8987643E-9 | |
| gdc.oaire.isgreen | true | |
| gdc.oaire.keywords | Deterministic scheduling theory in operations research | |
| gdc.oaire.keywords | tabu search | |
| gdc.oaire.keywords | Case-oriented studies in operations research | |
| gdc.oaire.keywords | multiperiod \(p\)-median problem | |
| gdc.oaire.keywords | Approximation methods and heuristics in mathematical programming | |
| gdc.oaire.keywords | pharmacy duty scheduling | |
| gdc.oaire.popularity | 4.6063082E-9 | |
| gdc.oaire.publicfunded | false | |
| gdc.oaire.sciencefields | 0211 other engineering and technologies | |
| gdc.oaire.sciencefields | 02 engineering and technology | |
| gdc.oaire.views | 10 | |
| gdc.openalex.collaboration | National | |
| gdc.openalex.fwci | 0.6732 | |
| gdc.openalex.normalizedpercentile | 0.73 | |
| gdc.opencitations.count | 7 | |
| gdc.plumx.crossrefcites | 7 | |
| gdc.plumx.mendeley | 16 | |
| gdc.plumx.scopuscites | 6 | |
| gdc.scopus.citedcount | 6 | |
| gdc.virtual.author | Özpeynirci, Özgür | |
| gdc.wos.citedcount | 5 | |
| relation.isAuthorOfPublication | c6a6133d-234b-4203-8221-22b84c80ed5d | |
| relation.isAuthorOfPublication.latestForDiscovery | c6a6133d-234b-4203-8221-22b84c80ed5d | |
| relation.isOrgUnitOfPublication | c9b8b195-ae12-421f-b46a-ed1f01ed1cb8 | |
| relation.isOrgUnitOfPublication | d61c5ef4-1ebc-4355-bc4f-dfa76978271b | |
| relation.isOrgUnitOfPublication | e9e77e3e-bc94-40a7-9b24-b807b2cd0319 | |
| relation.isOrgUnitOfPublication.latestForDiscovery | c9b8b195-ae12-421f-b46a-ed1f01ed1cb8 |
Files
Original bundle
1 - 1 of 1