TY - JOUR
T1 - Joint determination of machine cells and linear intercell layout
AU - Chiang, Chih Ping
AU - Lee, Shine Der
N1 - Funding Information:
This research was supported in part by the National Science Council of Taiwan under grant NSC91-2213-E-230-010.
PY - 2004/9
Y1 - 2004/9
N2 - The joint problem of manufacturing cell formation and its layout assignment is addressed in this paper, where machine cells are to be located along the popular bi-directional linear layout. The objective is to minimize the intercell flow cost under the cell size constraint, instead of the typical goal to minimize the number of intercell movements. An enhanced simulated annealing approach augmented with dynamic programming algorithm is developed, where the machine cells and their respective locations in the layout are simultaneously determined by dynamic programming. Consequently, the optimal number of machine cells is obtained by the problem structure, instead of a prior specification in most of the literature. The enhanced procedure is illustrated by an example and additional experiments, with data adapted from the literature, are performed to demonstrate the viability of the approach.
AB - The joint problem of manufacturing cell formation and its layout assignment is addressed in this paper, where machine cells are to be located along the popular bi-directional linear layout. The objective is to minimize the intercell flow cost under the cell size constraint, instead of the typical goal to minimize the number of intercell movements. An enhanced simulated annealing approach augmented with dynamic programming algorithm is developed, where the machine cells and their respective locations in the layout are simultaneously determined by dynamic programming. Consequently, the optimal number of machine cells is obtained by the problem structure, instead of a prior specification in most of the literature. The enhanced procedure is illustrated by an example and additional experiments, with data adapted from the literature, are performed to demonstrate the viability of the approach.
UR - http://www.scopus.com/inward/record.url?scp=1842812526&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=1842812526&partnerID=8YFLogxK
U2 - 10.1016/S0305-0548(03)00110-2
DO - 10.1016/S0305-0548(03)00110-2
M3 - Article
AN - SCOPUS:1842812526
SN - 0305-0548
VL - 31
SP - 1603
EP - 1619
JO - Computers and Operations Research
JF - Computers and Operations Research
IS - 10
ER -