A Constraint Satisfaction Engine for Collaborative Production Scheduling
Date Issued
2004
Date
2004
Author(s)
Tang, Ching-Wei
DOI
zh-TW
Abstract
Because the ownership of a supply chain network is mostly fragmented and the owners have different objectives, the distributed approach to the integration of production scheduling in supply chains is more likely to succeed than a centralized approach. We propose a design pattern for collaborative production scheduling at two network nodes and develop a Constraint Satisfaction Engine (CS Engine) to solve scheduling problem. Each of front shop and back shop generates schedule within the design pattern. Before collaborating, front shop analyzes the flexibility of its schedule and back shop generates the desirable from its schedule. Front shop then builds a rescheduling CSP for collaborative production scheduling by flexibility and desirable. Lastly, we show how the approach enables collaborative production scheduling and calibrates the performance of collaboration by numerical experiment.
Subjects
協同規劃
生產排程
供應鏈
制約滿足問題
supply chain
scheduling
flexibility
constraint satisfaction problem
collaboration
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-93-R91546028-1.pdf
Size
23.53 KB
Format
Adobe PDF
Checksum
(MD5):f2899b6bad6cdb8688d40d042d03c4ae