Qualitative Constraints for Job Shop Scheduling.
Jean-François Condotta, Gérard Ligozat, Mahmoud Saade · National Conference on Artificial Intelligence · 2009
This paper introduces a translation of the job shop scheduling problem into a qualitative constraint satisfaction problem using INDU and Allen relations. We show that the translation is sound and complete. We also use the notion of frozen constraints and show that it allows the user to consider only partial solutions when searching for solutions. Our work constitutes a new approach to the problem of constructing contentmotivated benchworks for qualitative calculi.