供應鏈協同式生產排程之制約滿足工具

A Constraint Satisfaction Engine for Collaborative Production Scheduling

湯慶偉(Ching-Wei Tang)

指導教授 ： 周雍強

國立臺灣大學/工學院/工業工程學研究所/碩士(2004年)

https://doi.org/10.6342/NTU.2004.00225

摘要

供應鏈網路的組織架構大致為分權的形式，各項決策的制定具有分權式的特性。供應鏈中廠商受自我利益與目標所驅動，因此採取分權式的整合方式較為自然，不僅成左漸i能性較高，所帶來的效益也較顯著。本研究針對供應鏈網路中兩節點之生產排程的協同規劃，提出一分權式設計樣形來進行節點間排程整合，並且發展一解題工具來求解排程整合問題。在本研究所提出之分權式設計樣形中，前階工廠與後階工廠依據其決策方法與規劃目標產生排程結果。藉由分析前階工廠排程中所具有的彈性資訊與後階工廠對於排程績效的改善要求，並利用彈性資訊來進行節點間生產排程的整合。本研究以半導體製造中，晶圓製造廠與晶圓針測廠來進行協同式生產排程的分析。透過所提出的分權式設計樣形，來建立晶圓製造廠與晶圓針測廠協同式生產排程模式，並利用數值範例來驗證分權式設計樣形的可行性與協同式生產排程的效益評估。

關鍵字

協同規劃 ； 生產排程 ； 供應鏈 ； 彈性資訊 ； 制約滿足問題

並列摘要

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.

並列關鍵字

supply chain ； scheduling ； flexibility ； constraint satisfaction problem ； collaboration

參考文獻

[2] Bessière, C., “Arc-consistency and Arc-consistency Again,” Artificial Intelligence 65, 1994, pp. 179-190.

[3] Bessière, C., Freuder, E. C., Regin, J. C., “Using Constraint Metaknowledge to Reduce Arc Consistency Computation,” Artificial Intelligence 107, 1999, pp. 125-148.

[4] Bhattacharya, P. P. and Ephremides, A., “Optimal Scheduling with Strict Deadlines,” IEEE Transactions on Automatic Control, Vol. 34, 1989, pp. 721-728.

[5] Brailsford, S. C., Potts, C. N., Smith, B. M., “Constraint Satisfaction Problems: Algorithms and Applications,” European Journal of Operational Research 119, 1999, pp. 557-581.

[6] Chmeiss, A. and Jégou, P. “Two New Constraint Propagation Algorithms Requiring Small Space Complexity,” 8th International Conference on Tools with Artificial Intelligence (ICTAI '96), 1996, pp. 286-289.