The Dynamic Line Allocation Problem

Reza H. Ahmadi, Sriram Dasu and Christopher S. Tang
Additional contact information
Reza H. Ahmadi: Anderson Graduate School of Management, University of California, Los Angeles, Los Angeles, California 90024
Sriram Dasu: Anderson Graduate School of Management, University of California, Los Angeles, Los Angeles, California 90024
Christopher S. Tang: Anderson Graduate School of Management, University of California, Los Angeles, Los Angeles, California 90024

Management Science, 1992, vol. 38, issue 9, 1341-1353

Abstract: Consider a plant that has information about the arrival schedule of its "inputs" over a planning cycle. The plant has parallel production lines for processing multiple types of products. However, changeover cost and changeover time are incurred when a line changes from processing one type of products to a different type of products. We present a dynamic line allocation problem that determines an optimal line allocation so that the total relevant cost (changeover and waiting costs) is minimized. In this paper we analyze the complexity of the problem and develop three different heuristics for generating near-optimal allocations.

Keywords: production planning; setup/changeover operation; resource allocation; heuristic (search for similar items in EconPapers)
Date: 1992
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.38.9.1341 (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:38:y:1992:i:9:p:1341-1353

Access Statistics for this article

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