Optimal Allocation of Cashiers and Pharmacists in Large Hospitals: A Point-Wise Fluid-Based Dynamic Queueing Network Approach
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
2870 | en_US |
dc.citation.spage |
2859 | en_US |
dc.citation.volume |
6 | en_US |
dc.contributor.author |
Lu, Chung-Cheng | en_US |
dc.contributor.author |
Lin, Shih-Wei | en_US |
dc.contributor.author |
Chen, Hui-Ju | en_US |
dc.contributor.author |
Ying, Kuo-Ching | en_US |
dc.contributor.department |
運輸與物流管理系 註:原交通所+運管所 | zh_TW |
dc.contributor.department |
Department of Transportation and Logistics Management | en_US |
dc.date.accessioned |
2018-08-21T05:53:20Z | |
dc.date.available |
2018-08-21T05:53:20Z | |
dc.date.issued |
2018-01-01 | en_US |
dc.description.abstract |
This paper presents an optimization model for determining the optimal time-varying numbers of cashiers and pharmacists in a large hospital. The objective of this model is to minimize the weighted sum of the waiting cost incurred by patients and the operating costs incurred by the hospital. A point-wise fluid based approximation approach is adopted to construct a dynamic queuing network that takes into account time-varying (or non-stationary) arrivals of patients and describes time-varying queue lengths. The dynamic queuing network is then encapsulated in the optimization model that determines the optimal time-varying numbers of cashiers and pharmacists. A test problem instance is designed based on a large hospital in the city of Taipei, and the MINOS solver of GAMS is applied to solve the problem instance. Sensitivity analyses are also conducted to examine the impacts of customer arrival rates and service rates on the waiting cost and operational cost. Numerical results show that the optimization model can provide an optimal allocation of manpower that significantly reduces both waiting and operating costs. | en_US |
dc.identifier.doi |
10.1109/ACCESS.2017.2785622 | en_US |
dc.identifier.issn |
2169-3536 | en_US |
dc.identifier.journal |
IEEE ACCESS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1109/ACCESS.2017.2785622 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/144566 | |
dc.identifier.wosnumber |
WOS:000425688200043 | en_US |
dc.language.iso |
en_US | en_US |
dc.subject |
Mathematical programming | en_US |
dc.subject |
hospitals | en_US |
dc.subject |
queueing analysis | en_US |
dc.subject |
manpower allocation | en_US |
dc.title |
Optimal Allocation of Cashiers and Pharmacists in Large Hospitals: A Point-Wise Fluid-Based Dynamic Queueing Network Approach | en_US |
dc.type |
Article | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 期刊論文
引用此條目
Lu, C.-C., Lin, S.-W., Chen, H.-J., & Ying, K.-C. (2018). Optimal Allocation of Cashiers and Pharmacists in Large Hospitals: A Point-Wise Fluid-Based Dynamic Queueing Network Approach. IEEE ACCESS, 6, 2859–2870. https://doi.org/10.1109/ACCESS.2017.2785622
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/144566