Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
A Constraint-Based Approach to Assigning System Components to Tasks
Applied Intelligence
Resource Configuration and Allocation-A Case Study of Constrained Heuristic Search
IEEE Expert: Intelligent Systems and Their Applications
BASYS '02 Proceedings of the IFIP TC5/WG5.3 Fifth IFIP/IEEE International Conference on Information Technology for Balanced Automation Systems in Manufacturing and Services: Knowledge and Technology Integration in Production and Services: Balancing Knowledge in Product and Service Life Cycle
Mathematical and Computer Modelling: An International Journal
Distributed control of production systems
Engineering Applications of Artificial Intelligence
Hi-index | 0.00 |
The importance of coordinating product, process, and supply chain (PPSC) decisions has received much attention and popularity in academia and industry alike. This paper formulates PPSC coordination as a factory loading allocation problem (FLAP) from a constraint satisfaction perspective. A domain-based FLAP reference model is proposed for the conceptualization of a multi-site manufacturing supply chain, considering multiple domains, network structures, product characteristics, decision variables, along with various constraints. A decision propagation structure (DPS) incorporating with a connectionist approach is developed based on the concept of constraint heuristic search to facilitate the exploration of solution spaces. A case study in a multi-national company is presented to illustrate the FLAP framework, which implies practical insights into PPSC coordination.