The Deterministic Dynamic Product Cycling Problem

Uday S. Karmarkar and Linus Schrage
Additional contact information
Uday S. Karmarkar: University of Rochester, Rochester, New York
Linus Schrage: The University of Chicago, Chicago, Illinois

Operations Research, 1985, vol. 33, issue 2, 326-345

Abstract: Certain manufacturing situations involve a small number of items produced sequentially on the same facility with high changeover cost. Production schedules are characterized by long runs, and individual items are produced infrequently. At the same time, seasonal demand patterns require that the items be maintained in inventory in the right mix. This paper presents alternative formulations of this problem. It uses a Lagrangean relaxation approach to decouple the problem and provide lower bounds used in a branch and bound algorithm. Some experimental computations on small problems are reported.

Keywords: 334 dynamic product cycling problem; 633 dynamic production planning (search for similar items in EconPapers)
Date: 1985
References: Add references at CitEc
Citations: View citations in EconPapers (40)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.33.2.326 (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:33:y:1985:i:2:p:326-345

Access Statistics for this article

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