Optimal allocation of cashier and dispensary servers in large hospitals

• Main Authors: Tsung-Chi Yu, 余宗琪
• Other Authors: 盧宗成
• Format: Others
• Language: zh-TW
• Published: 2013
• Online Access: http://ndltd.ncl.edu.tw/handle/tn8xh6

碩士 === 國立臺北科技大學 === 資訊與運籌管理研究所 === 101 === This study presents a multi-objective model to determine the optimal numbers of cashiers and dispensaries in a large hospital. The objectives are to minimize the total expected weighted waiting cost and the service cost. A point-wise fluid-based approximation approach is adopted to construct a dynamic queuing system that describes the expected queue length of customer. The dynamic queuing system is then encapsulated in an optimization model that determines optimal time-varying numbers of cashier and dispensary servers per time unit and subject to the minimal and maximal server requirements set by the hospital. A test problem instance was designed based on a large hospital in Taipei city, and the MINOS solver of GAMS was applied to solve for the optimal time-varying cashier and dispensary servers. The sensitivity analyses were also conducted to examine the impacts of customer arrival rates, service rates, and weights of the cost components in the objective function on the waiting cost and operational cost.