Current Proceedings on Technology
Yazarlar: Erjon Duka
Konular:-
Anahtar Kelimeler:Nurse,NSP,Nurse Scheduling Problem,Hospital.
Özet: In this subject, I will discuss the most relevant data instances, based on different elements for nurse scheduling problem (NSP). The NSP assigns nurses to shifts per day considering hard and soft constraints. NSP purpose´s is to maximize the nurses’ preferences and minimize the total penalty cost from violations of the soft constraints. The problem is known to be NP-hard. According the sophistication and importance in practice, many scientists have developed (meta-) heuristic transaction to solve a NSP instance heuristically in a satisfactory time limit. But these solution transaction are often very case-specific towards one hospital and hence, cannot be compared with each other. The lack of further data and multiple interpretations of how to evaluate solution procedures have contributed endless amount of newly developed procedures, without any attempt to reference them in the literature. The contribution of this paper is threefold. Initially, I propose a vast array of landmark cases for nurse scheduling problem in order to help the evaluation of existing techniques and future research. Apart this, I propose a computer platform independent criteria to evaluate and compare banned meta-heuristic procedures for NSP. In the end, I suggest a newly developed website where the benchmark instances can be downloaded and which solutions best known may be charged.LIST OF ABBREVIATIONS / NOTATIONS / GLOSSARY OF TERMS• NSP = Nurse Scheduling Problem• IP=Integer Programming• LIP= Linear Integer Programming• NIP= Non Linear Integer Programing• SIP = Scheduling in Integer Programming• Mixed Integer Programming = (MIP)• Goal Programming =(G-IP)• Constraint Programming (CP)• CPLEX, Limbo ext = Integer Porgramming applications and Software• NP-hard = Nurse Scheduling in Integer Programming• Section=Sec= Chapter• NSPLIB=the Nurse Scheduling Problem LIBrary• full-time equivalent levels = FTE