Stable solutions dealing with dynamics in scheduling based on dynamic constraint satisfaction problems

0Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

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 Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3157, pp. 989–990). Springer Verlag. https://doi.org/10.1007/978-3-540-28633-2_128

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free