Abstract
Constraint programming techniques have been widely used in many different types of applications. However for NP-hard problems, such as scheduling, resources allocation, etc, basic constraint programming techniques may not be enough solve efficiently. This paper describes a design and implementation of a simplified nurse rostering system using constraint programming and automatic implied constraint generation by meta-level reasoning. The nurse rostering system requires generating a weekly timetable by assigning work shifts to nurse. Although the problem set is simplified, the search is difficult because it involves more than hundred constraints with a search space of about 3.74 x 1050. Using only traditional constraint programming techniques, even in addition with popular heuristics, no timetable can be generated in reasonable time. To improve the search, we propose to use automatic implied constraint generation by meta-level reasoning. Several solvable and non-solvable problem instances were tested. With our approach, these instances can be solved or identified as non-solvable within one second.
The work described in this paper was substantially supported by a grant from the Research Grants Council of the Hong Kong Special Administrative Region, China (Project No. 9040517, CityU 1109/00E). This work was also partially supported by a grant from City University of Hong Kong (Project No. 7001286).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
B.M.W. Cheng, J.H.M. Lee and J.C.K. Wu, “A Nurse Rostering System Using Constraint Programming and Redundant Modeling,” IEEE Transactions on Information Technology in Biomedicine, 1, pp. 44–54, 1997
H.W. Chun, “A methodology for object-oriented constraint programming,” in Proc. 4th Asia-Pacific Software Engineering and International Computer Science Conf., 1997
H.W. Chun, “Constraint Programming in Java with JSolver”, in Proceedings of the First International Conference and Exhibition on The Practical Application of Constraint Technologies and Logic Programming, London, April 1999.
R. Dechter and J. Pearl, “Network-Based Heuristics for Constraint-Satisfaction Problems,” In Search in Artificial Intelligence, eds. L. Kanal and V. Kumar, Springer-Verlag, 1988.
E. Freuder, “Backtrack-Free and Backtrack-Bounded Search,” in Search in Artificial Intelligence, eds. L. Kanal and V. Kumar, pp. 343–369, New York: Springer-Verlag, 1988.
A. Jan, M. Yamamoto, A. Ohuchi, “Evolutionary algorithms for nurse scheduling problem,” in Proc. Evolutionary Computation, vol. 1, pp. 196–203, 2000
H. Kawanaka, K. Yamamoto, T. Yoshikawa, T. Shinogi, S. Tsuruoka, “Genetic algorithm with the constraints for nurse scheduling problem,” in Proc. Evolutionary Computation, vol. 2, pp. 1123–1130, 2001
V. Kumar, “Algorithms for constraint satisfaction problems: A survey,” AI Magazine, vol. 13, no. 1, pp. 32–44, 1992.
J.M. Lazaro, P. Aristondo, “Using SOLVER for nurse scheduling,” in Proc. ILOG SOLVER & ILOG SCHEDULE First Int. Users’ Conf., July 1995.
A.K. Mackworth, “Consistency in networks of relations,” Artificial Intelligence, 8, no. 1, pp. 99–118, 1977.
A.K. Mackworth and E.C. Freuder, “The complexity of some polynomial network consistency algorithms for constraint satisfaction problems,” Artificial Intelligence, 25, pp. 65–74, 1985.
H.E. Miller, “Nurse scheduling using mathematical programming,” Oper. Res., vol. 24, no. 8, pp. 857–870, 1976
R. Mohr and T.C. Henderson, “Arc and path consistency revised,” Artificial Intelligence, 28, pages 225–233, 1986.
I. Ozkarahan, J. Bailey, “Goal programming model subsystem of a flexible nurse scheduling support system,” IIE Trans., vol. 20, no. 3, pp. 306–316, 1988
E.P.K. Tsang, “Foundations of Constraint Satisfaction,” Academic Press, 1993.
P. Van Hentenryck, Y. Deville, and C.M. Teng, “A generic arc-consistency algorithm and its specializations,” Artificial Intelligence, 57, pages 291–321, 1992.
D.M. Warner, “Scheduling nursing personnel according to nursing preference: A mathematical programming approach,” Oper. Res., vol. 24, no. 8, pp. 842–856, 1976
G. Weil, K. Heus, P. Francois, and M. Poujade, “Constraint programming for nurse scheduling,” IEEE Eng. Med. Biol., vol. 14, no. 4, pp. 417–422, July/Aug. 1995.
G.Y.C. Wong and A.H.W. Chun “CP Heuristics: MWO/FFP Hybrid and Relaxed FFP,” In Proc. of the 4 th Systemics, Informatics and Cybernetics, Orlando, July 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wong, G.Y.C., Chun, H.W. (2003). Nurse Rostering Using Constraint Programming and Meta-level Reasoning. In: Chung, P.W.H., Hinde, C., Ali, M. (eds) Developments in Applied Artificial Intelligence. IEA/AIE 2003. Lecture Notes in Computer Science(), vol 2718. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45034-3_72
Download citation
DOI: https://doi.org/10.1007/3-540-45034-3_72
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40455-2
Online ISBN: 978-3-540-45034-4
eBook Packages: Springer Book Archive