A Greedy Double Swap Heuristic for Nurse Scheduling

A Greedy Double Swap Heuristic for Nurse Scheduling

One of the key challenges of nurse scheduling problem (NSP) is the number of constraints placed on preparing the timetable, both from the regulatory requirements as well as the patients’ demand for the appropriate nursing care specialists. In addition, the preferences of the nursing staffs related t...

Full description

Saved in:
Bibliographic Details
Main Authors: CHOY, Junyu, CHEONG, Michelle Lee Fong
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2012
Subjects:
Nursing scheduling
Mathematical programming
Swapping algorithm
Optimization framework
Computer Sciences
Health and Medical Administration
Operations Research, Systems Engineering and Industrial Engineering
Online Access:https://ink.library.smu.edu.sg/sis_research/1596
http://www.growingscience.com/msl/Vol2/msl_2012_143.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English

Internet

https://ink.library.smu.edu.sg/sis_research/1596
http://www.growingscience.com/msl/Vol2/msl_2012_143.pdf

Similar Items