National Conference on Artificial Intelligence · 1994 · 32 citations · 13 references
ComputingIndustrial EngineeringOperations ManagementAlgorithmsOptimizationSchedulingConstrained OptimizationConstraint ProgrammingConstraint SatisfactionConstraint SolvingConstraint-based SchedulingScheduling OptimizationCase Study EvaluationConstraint RelaxationCsp SolvingScheduling ConstraintsScheduling ProblemsTimetablingTimetabling Constraints
This paper describes a case study on a general-purpose Constraint Relaxation Problem solver, COASTOOL. Using COASTOOL, a problem can be solved merely by declaring what is the problem, without programming how to solve it. The problem is solved by a novel method that generates a high-quality initial assignment using arc-consistency, and refines it using hill-climbing. This approach has been evaluated successfully by experiments with practical high-school timetabling problems in Japan. Consequently, COASTOOL is shown to be efficient at applications in high-school timetabling problems.
13
On the Complexity of Timetable and Multicommodity Flow Problems
Shimon Even, Alon Itai, Adi Shamir · SIAM Journal on Computing · 1976 · 1.1K citations