Skip to main content

Stable Solutions Dealing with Dynamics in Scheduling Based on Dynamic Constraint Satisfaction Problems

  • Conference paper
PRICAI 2004: Trends in Artificial Intelligence (PRICAI 2004)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3157))

Included in the following conference series:

  • 1620 Accesses

Abstract

The real-life scheduling problems are often over-constrained, and there is often one intractable case where unexpected events are added and a sudden change is required. In this paper, we describe such problems as the Dynamic Valued Constraint Satisfaction Problem (DyVCSP). In DyVCSP, although the previous schedule would be modified when there is some change, the new schedule should be similar to the current one. We propose a method for achieving solution stability, which maintains portions of the current schedule using the provisional soft constraint. The provisional constraint ensures each variable keeps its value as much as possible. In this paper, we formalize the nurse scheduling problem as DyVCSP and use our method to achieve solution stability.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Similar content being viewed by others

References

  1. Wallace, R.J., Freuder, E.C.: Stable solutions for dynamic constraint satisfaction problems. In: Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming, pp. 447ā€“461 (1998)

    Google Scholar 

  2. Verfaillie, G., Schiex, T.: Solution reuse in dynamic constraint satisfaction problems. In: Proceedings of the 12th National Conference on Artificial Intelligence(AAAI 1994), pp. 307ā€“312 (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

Ā© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hattori, H., Shintani, T., Isomura, A., Ito, T., Ozono, T. (2004). Stable Solutions Dealing with Dynamics in Scheduling Based on Dynamic Constraint Satisfaction Problems. In: Zhang, C., W. Guesgen, H., Yeap, WK. (eds) PRICAI 2004: Trends in Artificial Intelligence. PRICAI 2004. Lecture Notes in Computer Science(), vol 3157. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28633-2_128

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-28633-2_128

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22817-2

  • Online ISBN: 978-3-540-28633-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics