Return to search

Solving the Distributed Constraint Satisfaction Problem for Cooperative Supply Chains Using Multi-agent Systems

Facing global and dynamic competition environment, companies have to collaborate with other companies instead of struggle alone to optimize performance of supply chain. In a distributed supply chain structure, it is an important issue for companies to coordinate seamlessly to effectively fulfill customer orders. In this thesis, we seek to propose a fast and flexible method to solve the order fulfillment scheduling conflicts among partners in a supply chain.
Due to the risk of exposing trade secrets and the cost of gathering information, the centralized constraint satisfaction mechanism is infeasible to handle distributed scheduling problem in real world environment. Moreover, the distributed constraints satisfaction model just focuses on finding a globally executable order fulfillment schedule. Therefore, we propose an agent-based distributed coordination mechanism that integrates negotiation with generic algorithm. We chose the mold manufacturing industry as an example and conducted experiments to evaluate the performance of the proposed mechanism and to compare with other benchmark methods proposed by researchers prior to this study. The experimental results indicate that the distributed coordination mechanism we proposed is a feasible approach to solve the order fulfillment scheduling conflicts in outsourcing activities in a supply chain.

Identiferoai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0723104-085302
Date23 July 2004
CreatorsKuo, Hui-chun
ContributorsFu-ren Lin, Hsin-Hui Lin, Te-Min Chang
PublisherNSYSU
Source SetsNSYSU Electronic Thesis and Dissertation Archive
LanguageEnglish
Detected LanguageEnglish
Typetext
Formatapplication/pdf
Sourcehttp://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0723104-085302
Rightscampus_withheld, Copyright information available at source archive

Page generated in 0.002 seconds