The dynamic line allocation problem

The dynamic line allocation problem

0.00 Avg rating0 Votes
Article ID: iaor1993938
Country: United States
Volume: 38
Issue: 9
Start Page Number: 1341
End Page Number: 1353
Publication Date: Sep 1992
Journal: Management Science
Authors: , ,
Keywords: heuristics, scheduling
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. The authors present a dyanmic line allocation problem that determines an optimal line allocation so that the total relevant cost (changeover and waiting costs) is minimized. In this paper they analyze the complexity of the problem and develop three different heuristics for generating near-optimal allocations.

Reviews

Required fields are marked *. Your email address will not be published.