Abstract
In this paper, we describe a new nurse scheduling system based on the framework of Constraint Satisfaction Problem (CSP). In the system, we must deal with dynamic changes to scheduling problem and with constraints that have different levels of importance. We describe the dynamic scheduling problem as a Dynamic Weighted Maximal CSP (DW-MaxCSP) in which constraints can be changed dynamically. It is usually undesirable to drastically modify the previous schedule in the re-scheduling process. A new schedule should be as close to as possible to the previous one. To obtain stable solutions, we propose methodology for keeping similarity to the previous schedule by using provisional constraints that explicitly penalize changes from the previous schedule. We have confirmed the efficacy of our system experimentally.
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
Abdennadher, S., Schlenker, H.: Nurse scheduling using constraint logic programming. In: Proc. of the 11th Annual Conference on Innovative Applications of Artificial Intelligence (IAAI 1999), pp. 838–843 (1999)
Hofe, H.M.: Conplan/siedaplan: Personnel assignment as a problem of hierarchical constraint satisfaction. In: Proc. of the 3rd International Conference on Practical Applications of Constraint Technologies (PACT 1997), pp. 257–272 (1997)
Dechter, R., Dechter, A.: Belief maintenance in dynamic constraint networks. In: Proc. of the 7th National Conference on Artificial Intelligence (AAAI 1988), pp. 37–42 (1988)
Miguel, I., Shen, Q.: Hard, flexible and dynamic constraint satisfaction. Knowledge Engineering Review 14, 285–293 (1999)
Verfaillie, G., Schiex, T.: Solution reuse in dynamic constraint satisfaction problems. In: Proc. of the 12th National Conference on Artificial Intelligence(AAAI 1994), pp. 307–312 (1994)
Wallace, R.J., Freuder, E.C.: Stable solutions for dynamic constraint satisfaction problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 447–461. Springer, Heidelberg (1998)
Selman, B., Levesque, H., Mitchell, D.: A new method for solving hard satisfiability problems. In: Proc. of the 10th National Conference on Artificial Intelligence (AAAI 1992), pp. 440–446 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hattori, H., Ito, T., Ozono, T., Shintani, T. (2005). A Nurse Scheduling System Based on Dynamic Constraint Satisfaction Problem. In: Ali, M., Esposito, F. (eds) Innovations in Applied Artificial Intelligence. IEA/AIE 2005. Lecture Notes in Computer Science(), vol 3533. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11504894_110
Download citation
DOI: https://doi.org/10.1007/11504894_110
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26551-1
Online ISBN: 978-3-540-31893-4
eBook Packages: Computer ScienceComputer Science (R0)