.png){kind=icon}
.png){kind=icon}
Return
Constraint programming for project-driven manufacturing
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ijpe.2008.12.016.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2009 Elsevier B.V. All rights reserved.
Keywords:
Decision support system
Constraint satisfaction problems
Production modeling
Scheduling
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10
Papers:
7.9K
Citations:
3.6W
Organization
View more organizations