Multi-objective Nurse Rerostering Problem

被引：0

作者：

Wu, Shih-Min ^{[1
]}

Okimoto, Tenda ^{[1
]}

Hirayama, Katsutoshi ^{[1
]}

Inoue, Katsumi ^{[2
]}

机构：

[1] Kobe Univ, Grad Sch Maritime Sci, Higashinadaku Fukaeminamimachi 5-1-1, Kobe, Hyogo 6580022, Japan

[2] Natl Inst Informat, Chiyodaku Hitotsubashi 2-1-2, Tokyo 1018430, Japan

来源：

MULTI-AGENT AND COMPLEX SYSTEMS | 2017年 / 670卷

关键词：

Nurse rerostering problem; Multi-objective weighted constraint satisfaction problem; Pareto optimality; Stability; Egalitarianism; SEARCH; PERTURBATION; HARD;

D O I：

10.1007/978-981-10-2564-8_10

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

How to schedule a limited number of nurses in hospital wards staffed 24 h a day is important issue for the satisfactory patient care and potentially improve nurse retention. Nurse Scheduling Problem (NSP) is a combinatorial optimization problem, in which a set of nurses must be assigned into a limited set of working slots, subject to a given set of hard and soft constraints. Various sophisticated algorithms have been developed for solving a NSP. It is natural to consider the scheduled nurse's unexpected absences, e.g., illness, accident and injury. Nurse Rerostering Problem (NRP) is a dynamic NSP where the aim is to reschedule the current roster so that the number of changes of assignments between current and modified schedules is minimized. In this paper, the focus is laid on NRP with multiple criteria and the "egalitarianism" among nurses in a modified schedule. A formal framework of Multi-Objective Nurse Rerostering Problem (MO-NRP) is defined where the aim is to find trade-off solutions among "optimality" and "stability". Also, a novel solution criterion called an egalitarian solution for a MO-NRP is introduced.

引用

页码：139 / 152

页数：14

共 50 条

[1] Evolutionary Multi-Objective Optimization for Nurse Scheduling Problem
Sharif, Omid
Uenveren, Ahmet
Acan, Adnan
[J]. 2009 FIFTH INTERNATIONAL CONFERENCE ON SOFT COMPUTING, COMPUTING WITH WORDS AND PERCEPTIONS IN SYSTEM ANALYSIS, DECISION AND CONTROL, 2010, : 144 - 147
[2] On Multi-Objective Optimization Heuristics for Nurse Rostering Problem
Liogys, Mindaugas
Zilinskas, Antanas
[J]. BALTIC JOURNAL OF MODERN COMPUTING, 2014, 2 (01): : 32 - 44
[3] CYBER SWARM ALGORITHMS FOR MULTI-OBJECTIVE NURSE ROSTERING PROBLEM
Yin, Peng-Yeng
Chiang, Ya-Tzu
[J]. INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2013, 9 (05): : 2043 - 2063
[4] An evolutionary approach for the nurse rerostering problem
Maenhout, Broos
Vanhoucke, Mario
[J]. COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (10) : 1400 - 1411
[5] Solving the multi-objective nurse scheduling problem with a weighted cost function
D. Parr
J. M. Thompson
[J]. Annals of Operations Research, 2007, 155 : 279 - 288
[6] Solving the multi-objective nurse scheduling problem with a weighted cost function
Parr, D.
Thompson, J. M.
[J]. ANNALS OF OPERATIONS RESEARCH, 2007, 155 (01) : 279 - 288
[7] A multi-objective model for a nurse scheduling problem by emphasizing human factors
Hamid, Mahdi
Tavakkoli-Moghaddam, Reza
Golpaygani, Fereshte
Vahedi-Nouri, Behdin
[J]. PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART H-JOURNAL OF ENGINEERING IN MEDICINE, 2020, 234 (02) : 179 - 199
[8] Solving a bi-objective nurse rerostering problem by using a utopic Pareto genetic heuristic
Pato, Margarida Vaz
Moz, Margarida
[J]. JOURNAL OF HEURISTICS, 2008, 14 (04) : 359 - 374
[9] A genetic algorithm approach to a nurse rerostering problem
Moz, Margarida
Pato, Margarida Vaz
[J]. COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (03) : 667 - 691
[10] Solving a bi-objective nurse rerostering problem by using a utopic Pareto genetic heuristic
Margarida Vaz Pato
Margarida Moz
[J]. Journal of Heuristics, 2008, 14 : 359 - 374

← 1 2 3 4 5 →