Consistency enforcing in scheduling: A general formulation based on energetic reasoning
Pierre Lòpez, Patrick Esquirol · 1996
Since the last decade, hard combinatorial problems such as scheduling have been the target of many approaches combining Operations Research and Artificial Intelligence techniques, focussed on constraint satisfaction as a general paradigm for representing and solving efficiently such problems (Van Hentenryck 89). Amongst these approaches, the so-called Constraint-Based