A two-stage method to determine the allocation and scheduling of medical staff in uncertain environments

被引:33
|
作者
Chen, Ping-Shun [1 ]
Lin, Ying-Jie [1 ]
Peng, Nai-Chun [1 ]
机构
[1] Chung Yuan Christian Univ, Dept Ind & Syst Engn, Taoyuan 320, Taiwan
关键词
Demand uncertainty; Goal programming; Staff size; Staff scheduling; Nurse scheduling; GOAL PROGRAMMING-MODEL; DECISION-MAKING; NURSING STAFF; SERVICE; NURSES; PERSPECTIVE; DEMAND; PRICE; SIZE;
D O I
10.1016/j.cie.2016.07.018
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Medical staff scheduling problems have received much attention from researchers. This research studies an integrated medical staff allocation and staff scheduling problem in uncertain environments. In order to solve the integrated problem, this research develops a two-stage algorithm based on goal programming to determine the smallest possible medical staff required and to create the best schedule for them. In the first stage, this study adopts a worst-case scenario approach to determine the minimum required medical staff. In the second stage, this study constructs hard and soft constraints for a monthly medical staff schedule and applies the analytic hierarchy process (AHP) to determine the penalty of soft constraints. By reducing the number of medical staff, this research determines the appropriate staff size based on the objective function of the constructed model. This research uses a medical image center and its radiological technologists as a case study. The results demonstrate that the proposed method can produce the appropriate number of radiological technologists based on different monthly workloads and can generate the least undesirable radiological technologist schedule. Hence, staff managers will have the ability and flexibility to assign different medical staff to each team department for each scheduling planning period in order to overcome the uncertainty of both patient issues and medical staff issues. (C) 2016 Elsevier Ltd. All rights reserved.
引用
收藏
页码:174 / 188
页数:15
相关论文
共 50 条
  • [41] A two-stage heuristic algorithm for locomotive scheduling
    Zhang, Jie
    Ni, Shaoquan
    Ge, Lulu
    Wang, Yuanyuan
    Information Technology Journal, 2013, 12 (11) : 2153 - 2159
  • [42] On Approximation Algorithms for Two-Stage Scheduling Problems
    Wu, Guangwei
    Chen, Jianer
    Wang, Jianxin
    FRONTIERS IN ALGORITHMICS, FAW 2017, 2017, 10336 : 241 - 253
  • [43] Two-stage Robust Optimal Scheduling for Microgrids
    Duan, Jiandong
    Cheng, Ran
    Wang, Jing
    2021 8TH INTERNATIONAL FORUM ON ELECTRICAL ENGINEERING AND AUTOMATION, IFEEA, 2021, : 505 - 510
  • [44] Logistics scheduling: Analysis of two-stage problems
    Yung-Chia Chang
    Chung-Yee Lee
    Journal of Systems Science and Systems Engineering, 2003, 12 (4) : 385 - 407
  • [45] LOGISTICS SCHEDULING: ANALYSIS OF TWO-STAGE PROBLEMS
    Yung-Chia CHANG
    Chung-Yee LEE
    Journal of Systems Science and Systems Engineering, 2003, (04) : 385 - 407
  • [46] The Price of Anarchy in Two-Stage Scheduling Games
    Ye, Deshi
    Chen, Lin
    Zhang, Guochuan
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, COCOA 2017, PT II, 2017, 10628 : 214 - 225
  • [47] A hybrid two-stage flowshop scheduling problem
    He, Longmin
    Sun, Shijie
    Luo, Runzi
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2007, 24 (01) : 45 - 56
  • [48] Scheduling production tasks in a two-stage FMS
    Blazewicz, J
    Pawlak, G
    Walter, B
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2002, 40 (17) : 4341 - 4352
  • [49] A two-stage scheduling method for deadline-constrained task in cloud computing
    Xiaojian He
    Junmin Shen
    Fagui Liu
    Bin Wang
    Guoxiang Zhong
    Jun Jiang
    Cluster Computing, 2022, 25 : 3265 - 3281
  • [50] A two-stage scheduling method for deadline-constrained task in cloud computing
    He, Xiaojian
    Shen, Junmin
    Liu, Fagui
    Wang, Bin
    Zhong, Guoxiang
    Jiang, Jun
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2022, 25 (05): : 3265 - 3281