.png){kind=icon}
返回
Pharmacy duty scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1111/itor.12204.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
pharmacy duty scheduling
multiperiod p-median problem
Tabu search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.9
论文数:
1.8K
被引数:
3.7K
机构
引用论文
Experimental Study on Breakdown Characteristics of Transformer Oil Influenced by Bubbles.png)
Energies
OAAI
EnergiesIF0
OAAI分享收藏Variable neighborhood tabu search and its application to the median cycle problem变邻域禁忌搜索及其在中环问题中的应用
PREAI
分享收藏
Neighborhood search heuristics for the uncapacitated facility location problem无能力设施选址问题的邻域搜索启发式方法
PREAI
分享收藏
查看更多内容