AI tools in scheduling problem solving: a solver based on a 'well-behaved' restriction of TCSPs

摘要

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.