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 addres...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of production economics Ročník 120; číslo 2; s. 463 - 475
Hlavní autoři: Banaszak, Z.A., Zaremba, M.B., Muszyński, W.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 01.08.2009
Elsevier
Elsevier Sequoia S.A
Edice:International Journal of Production Economics
Témata:
ISSN:0925-5273, 1873-7579
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0925-5273
1873-7579
DOI:10.1016/j.ijpe.2008.12.016