Efficient labeling and Constraint Relaxation for Solving Time Tabling Problems
Patrice Boizumault, Christelle Gueret, Narendra Jussien · HAL (Le Centre pour la Communication Scientifique Directe) · 1994
Constraint Logic Programming over Finite Domains, CLP(FD), has been in constant development for a few years. CLP(FD) allows an efficient resolution of various highly combinatorial problems in scheduling, cutting-stock, warehouse location, planning, molecular biology ... [DIN 90a,b,c], [BAP 92], [BEL 92], [CHA 92], [CLA 93], [BOI 94b]. From a software engineering view point, this approach provides an easy prototyping and induces rapid development times. This is due to the integration of a powerful constraint propagation mechanism (Consistency Techniques) in a Logic Programming language (Prolog).