Abstract
We consider the problem of choosing the number and type of machines for each station in a new production line where the sequence of processes (i.e., manufacturing recipe) has already been established. We formulate a model to minimize cost (investment plus operating) subject to constraints on throughput and cycle time. Using queueing network approximations within a dynamic programming framework, we develop a line design algorithm that works in station-wise fashion. For computational tractability, we must discretize a continuous state space. However, we are able to compute bounds on the error in the cost function as a guide to the appropriate choice of grid size. We conclude by applying our algorithm to an industrial problem that motivated this work.
Original language | English (US) |
---|---|
Pages (from-to) | 891-903 |
Number of pages | 13 |
Journal | IIE Transactions (Institute of Industrial Engineers) |
Volume | 34 |
Issue number | 10 |
DOIs | |
State | Published - Oct 2002 |
Bibliographical note
Funding Information:This work was supported in part by The Center for Manufacturing and Logistics Research, Motorola, Inc., and the National Science Foundation under Grant DM!-9322830.