Developing three-phase modified bat algorithms to solve medical staff scheduling problems while considering minimal violations of preferences and mean workload
Restricted accessResearch articleFirst published online May, 2022
Developing three-phase modified bat algorithms to solve medical staff scheduling problems while considering minimal violations of preferences and mean workload
This research studies a medical staff scheduling problem, which includes government regulations and hospital regulations (hard constraints) and the medical staff’s preferences (soft constraints).
OBJECTIVE:
The objective function is to minimize the violations (or dissatisfaction) of medical staff’s preferences.
METHODS:
This study develops three variants of the three-phase modified bat algorithms (BAs), named BA1, BA2, and BA3, in order to satisfy the hard constraints, minimize the dissatisfaction of the medical staff and balance the workload of the medical staff. To ensure workload balance, this study balances the workload among medical staff without increasing the objective function values.
RESULTS:
Based on the numerical results, the BA3 outperforms the BA1, BA2, and particle swarm optimization (PSO). The robustness of the BA1, BA2, and BA3 is verified. Finally, conclusions are drawn, and directions for future research are highlighted.
CONCLUSIONS:
The framework of this research can be used as a reference for other hospitals seeking to determine their future medical staff schedule.
AngBYLamSWSPasupathyYOngMEH. Nurse workforce scheduling in the emergency department: a sequential decision support system considering multiple objectives. J Nurs Manage.2018; 26(4): 432-441.
2.
LiuRXieXL. Physician staffing for emergency departments with time-varying demand. Informs J Comput.2018; 30(3): 588-607.
3.
ChenYGabrielRAKodaliBSUrmanRD. Effect of anesthesia staffing ratio on first-case surgical start time. J Med Syst.2016; 40(5): Article 115.
4.
WrightPDBretthauerKM. Strategies for addressing the nursing shortage: coordinated decision making and workforce flexibility. Decision Sci.2010; 41(2): 373-401.
5.
LapointeRBhesaniaSTannerTPeruriAMehtaP. An innovative approach to improve communication and reduce physician stress and burnout in a university affiliated residency program. J Med Syst.2018; 42(7): Article 117.
6.
PuenteJGómezAFernándezIPrioreP. Medical doctor rostering problem in a hospital emergency department by means of genetic algorithms. Comput Ind Eng.2009; 56(4): 1232-1242.
7.
GangulySLawrenceSPratherM. Emergency department staff planning to improve patient care and reduce costs. Decision Sci.2014; 45(1): 115-145.
8.
WongTCXuMChinKS. A two-stage heuristic approach for nurse scheduling problem: a case study in an emergency department. Comput Oper Res.2014; 51: 99-110.
9.
DexterFEpsteinRH. Influence of annual meetings of the American society of anesthesiologists and of large national surgical societies on caseloads of major therapeutic procedures. J Med Syst.2018; 42(12): Article 259.
10.
WutthisirisartPMartinezGHeatonHAPasupathyKThompsonMSSirMY. Maximizing patient coverage through optimal allocation of residents and scribes to shifts in an emergency department. J Med Syst.2018; 42(11): Article 212.
11.
De BrueckerPVan den BerghJBeliënJDemeulemeesterE. Workforce planning incorporating skills: state of the art. Eur J Oper Res.2015; 243(1): 1-16.
DefraeyeMVan NieuwenhuyseI. Staffing and scheduling under nonstationary demand for service: a literature review. Omega-Int J Manage S.2016; 58: 4-25.
14.
LegrainABouarabHLahrichiN. The nurse scheduling problem in real-life. J Med Syst.2015; 39(1): Article 160.
15.
ErnstATJiangHKrishnamoorthyMSierD. Staff scheduling and rostering: a review of applications, methods and models. Eur J Oper Res.2004; 153(1): 3-27.
16.
van den BerghJBeliënJDe BrueckerPDemeulemeesterEDe BoeckL. Personnel scheduling: a literature review. Eur J Oper Res.2013; 226(3): 367-385.
17.
HuangW-TChenP-SLiuJJChenY-RChenY-H. Dynamic configuration scheduling problem for stochastic medical resources. J Biomed Inform.2018; 80: 96-105.
18.
ChenP-SLinYJPengNC. A two-stage method to determine the allocation and scheduling of medical staff in uncertain environments. Comput Ind Eng.2016; 99: 174-188.
19.
BagheriMDevinAGIzanlooA. An application of stochastic programming method for nurse scheduling problem in real word hospital. Comput Ind Eng.2016; 96: 192-200.
20.
ZhengZRLiuXYGongXJ. A simple randomized variable neighbourhood search for nurse rostering. Comput Ind Eng.2017; 110: 165-174.
21.
ZandaSZuddasPSeatzuC. Long term nurse scheduling via a decision support system based on linear integer programming: a case study at the University Hospital in Cagliari. Comput Ind Eng.2018; 126: 337-347.
22.
BurkeEKDe CausmaeckerPVanden BergheGVan LandeghemH. The state of the art of nurse rostering. J Sched.2004; 7(6): 441-499.
23.
OsogamiTImaiH. Classification of various neighborhood operations for the nurse scheduling problem. In: Lee DT, Teng S-H, eds. Algorithms and Computation. ISAAC 2000, LNCS 1969, 72-83: Springer-Verlag Berlin Heidelberg; 2000.
24.
SorensenK. Metaheuristics-the metaphor exposed. Int T Oper Res.2015; 22(1): 3-18.
25.
BouajajaSDridiN. A survey on human resource allocation problem and its applications. Oper Res-Ger.2017; 17(2): 339-369.
26.
CormenTHLeisersonCERivestRLSteinC. Introduction to Algorithms. Third edition ed. Cambridge, MA, USA: The MIT Press; 2009.
27.
GutjahrWJRaunerMS. An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria. Comput Oper Res.2007; 34(3): 642-666.
28.
TsaiC-CLiSHA. A two-stage modeling with genetic algorithms for the nurse scheduling problem. Expert Syst Appl.2009; 36(5): 9506-9512.
29.
AwadallahMA, Bolaji ALaAl-BetarMA. A hybrid artificial bee colony for a nurse rostering problem. Appl Soft Comput.2015; 35: 726-739.
30.
TodorovicNPetrovicS. Bee colony optimization algorithm for nurse rostering. IEEE Trans Syst Man Cybern Syst.2013; 43(2): 467-473.
31.
LinCCKangJRChiangDJChenCL. Nurse scheduling with joint normalized shift and day-off preference satisfaction using a genetic algorithm with immigrant scheme. Int J Distrib Sens N. 2015; 2015: Article ID 595419, 10 pages.
32.
MichaelCJefferyCDavidC. Nurse preference rostering using agents and iterated local search. Ann Oper Res.2015; 226(1): 443-461.
33.
XiangWYinJLimGN. A short-term operating room surgery scheduling problem integrating multiple nurses roster constraints. Artif Intell Med.2015; 63(2): 91-106.
34.
WuTHYehJYLeeYM. A particle swarm optimization approach with refinement procedure for nurse rostering problem. Comput Oper Res.2015; 54: 52-63.
35.
MoonWH. Development and evaluation of NRMIS (Nursing Resources Management Information System) for managing healthcare resources. Technol Health Care.2019; 27(5): 557-565.
36.
YaoHCChenPJKuoYTShihCCWangXYChenPS. Solving patient referral problems by using bat algorithm. Technol Health Care.2020; 28(S1): 433-442.
37.
YangX-S. A New Metaheauristic Bat-Inspired Algorithm. Nature Inspired Cooperative Strategies for Optimization (NICSO 2010), Volume 284 of the series studies in Computational Intelligence: Springer Berlin Heidelberg; 2010. 65-74.
38.
YılmazSKüçüksilleEU. A new modification approach on bat algorithm for solving optimization problems. Appl Soft Comput.2015; 28: 259-275.
39.
ShengX-HYeC-M. Application of bat algorithm to permutation flow-shop scheduling problem. Ind Eng J.2013; 16(1): 121-124.
40.
XuHBaoZRZhangT. Solving dual flexible job-shop scheduling problem using a bat algorithm. Adv Prod Eng Manag.2017; 12(1): 5-16.
41.
LiZMaLZhangH. Genetic mutation bat algorithm for 0–1 knapsack problem. Comput Eng Appl.2012; 50(11): 49-52.
42.
ZhouYQLiLLMaMZ. A complex-valued encoding bat algorithm for solving 0-1 knapsack problem. Neural Process Lett.2016; 44(2): 407-430.
43.
OsabaEYangXSDiazFLopez-GarciaPCarballedoR. An improved discrete bat algorithm for symmetric and asymmetric traveling salesman problems. Eng Appl Artif Intel.2016; 48: 59-71.
44.
CaiXJGaoXZXueY. Improved bat algorithm with optimal forage strategy and random disturbance strategy. Int J Bio-Inspir Com.2016; 8(4): 205-214.
45.
YahyaNMTokhiMO. A modified bats echolocation-based algorithm for solving constrained optimisation problems. Int J Bio-Inspir Com.2017; 10(1): 12-23.
46.
ChenPSZengZY. Developing two heuristic algorithms with metaheuristic algorithms to improve solutions of optimization problems with soft and hard constraints: An application to nurse rostering problems. Appl Soft Comput. 2020; 93: Article 106336.
47.
ChenPSLinYJPengNC. A two-stage method to determine the allocation and scheduling of medical staff in uncertain environments. Comput Ind Eng.2016; 99: 174-188.
48.
SaatyTL. The Analytic Hierarchy Process: McGraw Hill International; 1980.
49.
SaatyTL. Decision Making For Leaders-the Analytic Hierarchy Process for Decisions in a Complex World: Pittsburgh, PA: RWS Publications; 1990.
