Please use this identifier to cite or link to this item:
|Title:||Dynamic multi-linked negotiations in multi-echelon production scheduling networks|
|Citation:||Lau, H.C., Soh, G.L., Wan, W.C. (2007). Dynamic multi-linked negotiations in multi-echelon production scheduling networks. Proceedings - 2006 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT 2006 Main Conference Proceedings), IAT'06 : 498-505. ScholarBank@NUS Repository. https://doi.org/10.1109/IAT.2006.56|
|Abstract:||In this paper, we are concerned with scheduling resources in a multi-tier production/logistics system for multi-indenture goods. Unlike classical production scheduling problems, the problem we study is concerned with local utilities which are private. We present an agent model and investigate an efficient scheme for handling multi-linked agent negotiations. With this scheme we attempt to overcome the drawbacks of sequential negotiations and negotiation parameter settings. Our approach is based on embedding a credit-based negotiation protocol within a local search scheduling algorithm. We demonstrate the computational efficiency and effectiveness of the approach in solving a real-life dynamic production scheduling problem which balances between global production cost and local utilities within the facilities. © 2006 IEEE.|
|Source Title:||Proceedings - 2006 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT 2006 Main Conference Proceedings), IAT'06|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 11, 2018
checked on Jun 29, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.