Multi-Echelon Assembly Systems with Nonstationary Demands: Heuristics and Worst Case Performance Bounds

Dev Joneja
Additional contact information
Dev Joneja: Columbia University, New York, New York

Operations Research, 1991, vol. 39, issue 3, 512-518

Abstract: In a multi-echelon assembly system, each production stage has inputs from a number of preceding stages, and supplies at most one succeeding stage. The product of the final stage is used to satisfy external demand in discrete time. There are fixed setup costs and linear inventory holding costs at each stage. The objective is to minimize the cost of operating the system over a finite time horizon. We consider the common case of nonstationary demands, and propose an extremely fast and simple single-pass approximation algorithm for this problem. We prove that in the worst case the performance of the algorithm is uniformly bounded.

Keywords: inventory/production: multi-echelon assembly systems; production/scheduling: heuristics with error bounds (search for similar items in EconPapers)
Date: 1991
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.39.3.512 (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:oropre:v:39:y:1991:i:3:p:512-518

Access Statistics for this article

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