- 【Updated on May 12, 2025】 Integration of CiNii Dissertations and CiNii Books into CiNii Research
- Trial version of CiNii Research Knowledge Graph Search feature is available on CiNii Labs
- 【Updated on June 30, 2025】Suspension and deletion of data provided by Nikkei BP
- Regarding the recording of “Research Data” and “Evidence Data”
Constraints and search efficiency in nurse scheduling problem
Description
The nurse scheduling problem (NSP) is that of allocating shifts for nurses under various constraints. Generally, the extensive number of constraints requires a great knowledge and experience to make a nurse's scheduling table. This task requires a lot of time and effort and there is demand for an automatic scheduling. This study focuses the relationship between constraints and search efficiency, and discusses the affect for search efficiency, with the way to take the constraints into GA. This paper especially focuses the constraints that must be satisfied absolutely in the coding and genetic operations, and shows that his method can reduce the search area of GA drastically using numerical approximation method. Scheduling tables are acquired by the conventional and proposed method, and the result shows that effective search can be done and effective nurse scheduling tables can be generated by the proposed method.
Journal
-
- Proceedings 2003 IEEE International Symposium on Computational Intelligence in Robotics and Automation. Computational Intelligence in Robotics and Automation for the New Millennium (Cat. No.03EX694)
-
Proceedings 2003 IEEE International Symposium on Computational Intelligence in Robotics and Automation. Computational Intelligence in Robotics and Automation for the New Millennium (Cat. No.03EX694) 1 312-317, 2004-03-02
IEEE