Abstract
Nurse Scheduling Problem is traditionally studied as a multi objective problem which aims at an optimum scheduling of nurse assignment to patients in a hospital. Remote healthcare is involved with providing quality care and medical assistance to patients based on remote monitoring. This paper presents an in-depth study of nurse scheduling algorithms. This study is followed with a description of the existing logics and the open issues. It also presents a heuristic framework with new features and a variable wait time based multi-parametric cost function for managing the dynamic NSP associated to remote healthcare.
Author supplied keywords
Cite
CITATION STYLE
Sarkar, P., Chaki, R., & Sinha, D. (2017). A heuristic framework for priority based nurse scheduling. In Advances in Intelligent Systems and Computing (Vol. 567, pp. 3–18). Springer Verlag. https://doi.org/10.1007/978-981-10-3409-1_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
