A Lower Bound and an Efficient Heuristic for Multistage Multiproduct Distribution Systems

DOI10.1287/mnsc.39.2.204zbMath0774.90027OpenAlexW2149231412MaRDI QIDQ5288826

Derek Atkins, Paul Iyogun

Publication date: 14 November 1993

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.39.2.204

zbMATH Keywords

lower boundlot-sizingmultistage and multifacility pure distribution network

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (5)

Controlling lead times and minor ordering costs in the joint replenishment problem with stochastic demands under the class of cyclic policies ⋮ Inventory Management: An Overview, Canadian Publications, Practical Applications and Suggestions for Future Research ⋮ Integrated production/distribution planning in supply chains: An invited review ⋮ An integrated inventory-transportation system with modified periodic policy for multiple products ⋮ Competitive methods for multi-level lot sizing and scheduling: tabu search and randomized regrets

This page was built for publication: A Lower Bound and an Efficient Heuristic for Multistage Multiproduct Distribution Systems