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

Paul Iyogun and Derek Atkins
Additional contact information
Paul Iyogun: School of Business and Economics, Wilfrid Laurier University, Waterloo, Ontario, Canada N2L 3C5
Derek Atkins: Faculty of Commerce and Business Administration, The University of British Columbia, Vancouver, BC, Canada V6T 1Y8

Management Science, 1993, vol. 39, issue 2, 204-217

Abstract: This paper concerns lot-sizing in a multistage and multifacility pure distribution network. A facility at the end of the distribution network experiences a deterministic and continuous demand. Each facility has an echelon holding cost rate for each item it distributes, and a facility-dependent set up cost. In this paper an algorithm is presented of complexity 0(rd log r) where r is the number of end facilities and d is the maximum depth of the distribution system. The algorithm exploits a lower bound obtained by decomposing the distribution network into facilities-in-series problems. Using a set up cost allocation procedure, the maximum of the continuous solution of the decomposed problem is obtained. This maximizing solution provides the lower bound which is used for solving the distribution problem. This gives a power-of-two heuristic with a worst case performance no more than 2% above optimal.

Keywords: inventory; multi-stage; distribution; lower bound; heuristic (search for similar items in EconPapers)
Date: 1993
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.39.2.204 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:39:y:1993:i:2:p:204-217

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().