Optimal Allocation of Cashiers and Pharmacists in Large Hospitals: A Point-Wise Fluid-Based Dynamic Queueing Network Approach
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-w...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2018-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8240920/ |
id |
doaj-e1d565301978482bb486e17a0aa4e176 |
---|---|
record_format |
Article |
spelling |
doaj-e1d565301978482bb486e17a0aa4e1762021-03-29T20:33:59ZengIEEEIEEE Access2169-35362018-01-0162859287010.1109/ACCESS.2017.27856228240920Optimal Allocation of Cashiers and Pharmacists in Large Hospitals: A Point-Wise Fluid-Based Dynamic Queueing Network ApproachChung-Cheng Lu0https://orcid.org/0000-0001-8317-4193Shih-Wei Lin1https://orcid.org/0000-0003-1343-0838Hui-Ju Chen2Kuo-Ching Ying3https://orcid.org/0000-0002-9549-5290Department of Transportation and Logistics Management, National Chiao Tung University, Hsinchu, TaiwanDepartment of Information Management, Chang Gung University, Taoyuan, TaiwanDepartment of Transportation and Logistics Management, National Chiao Tung University, Hsinchu, TaiwanDepartment of Industrial Engineering and Management, National Taipei University of Technology, Taipei, TaiwanThis 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.https://ieeexplore.ieee.org/document/8240920/Mathematical programminghospitalsqueueing analysismanpower allocation |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Chung-Cheng Lu Shih-Wei Lin Hui-Ju Chen Kuo-Ching Ying |
spellingShingle |
Chung-Cheng Lu Shih-Wei Lin Hui-Ju Chen Kuo-Ching Ying Optimal Allocation of Cashiers and Pharmacists in Large Hospitals: A Point-Wise Fluid-Based Dynamic Queueing Network Approach IEEE Access Mathematical programming hospitals queueing analysis manpower allocation |
author_facet |
Chung-Cheng Lu Shih-Wei Lin Hui-Ju Chen Kuo-Ching Ying |
author_sort |
Chung-Cheng Lu |
title |
Optimal Allocation of Cashiers and Pharmacists in Large Hospitals: A Point-Wise Fluid-Based Dynamic Queueing Network Approach |
title_short |
Optimal Allocation of Cashiers and Pharmacists in Large Hospitals: A Point-Wise Fluid-Based Dynamic Queueing Network Approach |
title_full |
Optimal Allocation of Cashiers and Pharmacists in Large Hospitals: A Point-Wise Fluid-Based Dynamic Queueing Network Approach |
title_fullStr |
Optimal Allocation of Cashiers and Pharmacists in Large Hospitals: A Point-Wise Fluid-Based Dynamic Queueing Network Approach |
title_full_unstemmed |
Optimal Allocation of Cashiers and Pharmacists in Large Hospitals: A Point-Wise Fluid-Based Dynamic Queueing Network Approach |
title_sort |
optimal allocation of cashiers and pharmacists in large hospitals: a point-wise fluid-based dynamic queueing network approach |
publisher |
IEEE |
series |
IEEE Access |
issn |
2169-3536 |
publishDate |
2018-01-01 |
description |
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. |
topic |
Mathematical programming hospitals queueing analysis manpower allocation |
url |
https://ieeexplore.ieee.org/document/8240920/ |
work_keys_str_mv |
AT chungchenglu optimalallocationofcashiersandpharmacistsinlargehospitalsapointwisefluidbaseddynamicqueueingnetworkapproach AT shihweilin optimalallocationofcashiersandpharmacistsinlargehospitalsapointwisefluidbaseddynamicqueueingnetworkapproach AT huijuchen optimalallocationofcashiersandpharmacistsinlargehospitalsapointwisefluidbaseddynamicqueueingnetworkapproach AT kuochingying optimalallocationofcashiersandpharmacistsinlargehospitalsapointwisefluidbaseddynamicqueueingnetworkapproach |
_version_ |
1724194624423067648 |