Title :
AI tools in scheduling problem solving: a solver based on a "well-behaved" restriction of TCSPs
Author :
Belhadji, Saïd ; Isli, Amar
Author_Institution :
LIPN, Univ. Paris-Nord, Villetaneuse, France
Abstract :
The aim of the paper is to describe a temporal constraint based solver for (job shop) scheduling problems. The heart of the solver is a "well behaved" restriction of the framework of TCSPs defined by R. Dechter, I. Meiri and J. Pearl (1991): the restriction is an algebra and expresses convex constraints or unions of two such constraints. We give a general description of the solver and show its completeness.
Keywords :
minimisation; production control; scheduling; temporal logic; temporal reasoning; AI tools; completeness; convex constraints; job shop scheduling problems; scheduling problem solving; temporal constraint based solver; well behaved TCSP restriction; well behaved restriction; Active appearance model; Artificial intelligence; Finishing; Heart; Job shop scheduling; Mathematical programming; Problem-solving;
Conference_Titel :
Tools with Artificial Intelligence, 1996., Proceedings Eighth IEEE International Conference on
Print_ISBN :
0-8186-7686-7
DOI :
10.1109/TAI.1996.560772
