COLLABORATIVE PLANNING IN SUPPLY CHAINS BY LAGRANGIAN RELAXATION AND GENETIC ALGORITHMS

DOI10.1142/S0219622008002879zbMath1159.90380MaRDI QIDQ3528990

Xiaofei Xu, Lanshun Nie, Dechen Zhan

Publication date: 17 October 2008

Published in: International Journal of Information Technology & Decision Making (Search for Journal in Brave)

zbMATH Keywords

Lagrangian relaxation methodmulti-level multi-item capacitated lot sizing problem

Mathematics Subject Classification ID

Production models (90B30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

FROM CHOICE OF PROCUREMENT STRATEGY TO SUPPLY NETWORK CONFIGURATION: AN EVOLUTIONARY APPROACH, A LAGRANGIAN-BASED SOLUTION ALGORITHM FOR STRATEGIC SUPPLY CHAIN DISTRIBUTION DESIGN IN UNCERTAIN ENVIRONMENT, Coordination mechanisms with mathematical programming models for decentralized decision-making: a literature review

Cites Work

• Unnamed Item
• Unnamed Item
• Negotiation-based collaborative planning between supply chains partners
• Supply chain partnerships: Opportunities for operations research
• Surrogate gradient algorithm for Lagrangian relaxation
• Hierarchical coordination mechanisms within the supply chain.
• Integrated production/distribution planning in supply chains: An invited review
• Supply Chain Coordination Under Channel Rebates with Sales Effort Effects
• Supply Chain Coordination with Revenue-Sharing Contracts: Strengths and Limitations
• Decentralized Multi-Echelon Supply Chains: Incentives and Information
• Competitive and Cooperative Inventory Policies in a Two-Stage Supply Chain
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
• Backup Agreements in Fashion Buying—The Value of Upstream Flexibility