A Mixed Closure-CSP Method to Solve Scheduling Problems

  • María Isabel Alfonso Galipienso
  • Federico Barber Sanchís
Conference paper

DOI: 10.1007/3-540-45517-5_63

Volume 2070 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Galipienso M.I.A., Sanchís F.B. (2001) A Mixed Closure-CSP Method to Solve Scheduling Problems. In: Monostori L., Váncza J., Ali M. (eds) Engineering of Intelligent Systems. IEA/AIE 2001. Lecture Notes in Computer Science, vol 2070. Springer, Berlin, Heidelberg

Abstract

Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-based methods which interleave (sequentially) searching efforts with the application of consistency enforcing mechanisms and variable/value ordering heuristics. Alternatively, in this paper, we propose a new method that integrates effectively the CSP process into a limited closure process. Such integration allows us to define better informed heuristics. They are used to limit the complete closure process applied, with a number of disjunctive constraints, and so reduce their complexity, while reducing the search space. Moreover, we can maintain more time open disjunctive solutions in the CSP process, limiting the number of backtrackings realized. We show preliminary results obtained from several instances of scheduling problems.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • María Isabel Alfonso Galipienso
    • 1
  • Federico Barber Sanchís
    • 2
  1. 1.Depto. Ciencia de la Computación e Inteligencia ArtificialUniversidad de AlicanteAlicanteSpain
  2. 2.Depto. de Sistemas Informáticos y ComputaciónUniversidad Politécnica de ValenciaValenciaSpain