Constraint programming for project-driven manufacturing

Project-driven manufacturing, based on the make-to-order or the build-to-order principle and predominant in small and medium-size enterprises (SMEs), calls for an efficient solution of large combinatorial problems, especially in such areas as task scheduling or resource management. This paper addresses the problem of finding a computationally effective approach to scheduling a new project subject to constraints imposed by a multi-project environment. A constraint programming (CP) modeling framework is discussed in the context of an efficient decomposition of the constraint satisfaction problem (CSP) and the evaluation of strategies for pruning the search tree. The proposed approach is illustrated through examples of its application to the evaluation of a new production order.