loading...
Collaborative Planning in Supply Chains by Lagrangian Relaxation
Hangzhou, Zhejiang, China June 20-June 24
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IMSCCS.2006.1992006 First International Multi-Sympos ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Lanshun Nie, Harbin Institute of Technology, China
Xiaofei Xu, Harbin Institute of Technology, China
Dechen Zhan, Harbin Institute of Technology, China
A collaborative planning framework based on the Lagrangian Relaxation method is developed to coordinate and optimize the production planning of the independent partners linked by material flows in multiple tier supply chains. Linking constraints and dependent demand constraints were added to the monolithic Multi-Level, multi-item Capacitated Lot Sizing Problem (MLCLSP) for supply chains. Model MLCLSP was Lagrangian relaxed and decomposed into facility-separable subproblems based on the separability of it. Surrogate gradient algorithm was used to update Lagrangian multipliers, which coordinated decentralized decisions of the facilities in supply chains. Production planning of independent partners could be appropriately coordinated and optimized by this framework without intruding their decision authorities and private information. This collaborative planning scheme was applied to a large set problem in supply chain production planning. Experimental results show that the proposed coordination mechanism and procedure come close to optimal results as obtained by central coordination.
Citation:
Lanshun Nie, Xiaofei Xu, Dechen Zhan, "Collaborative Planning in Supply Chains by Lagrangian Relaxation," imsccs, vol. 2, pp.314-321, 2006 First International Multi-Symposiums on Computer and Computational Sciences, 2006
Usage of this product signifies your acceptance of the Terms of Use.