TY - JOUR
T1 - Multiple routeings and capacity considerations in group technology applications
AU - Nagi, Rakesh
AU - Harhalakis, George
AU - Proth, Jean Marie
N1 - Funding Information:
Acknowledgments The authors would like to acknowledge the Engineering Research Center program NSFD CPR88003012 of the University of Maryland, and the Institut National de Recherche en Tnformatique et an Automatique (INRIA-LORRAINE, France) for funding this research.
PY - 1990/12
Y1 - 1990/12
N2 - This paper addresses the problem of manufacturing cell formation, given multiple part routeings, and multiple functionally similar workcentres. Cellular manufacturing is intended to facilitate production, and thus should be based on projected production requirements. The originality of the approach lies in considering both the manufacturing system as well as projected production, and distributing the demand among alternate routeings in order to obtain a better manufacturing cell design. The suggested choice of part routeings favours the decomposition of the manufacturing system into manufacturing cells in a way that minimizes part traffic, along with satisfying the part demand and workcentre capacity constraints. We show that the problem can be formulated as a linear programming type problem which simultaneously addresses two problems: (i) routeing selection, and (ii) cell formation. The common objective is to minimize the inter-cell traffic in the system. The proposed algorithm iteratively solves two problems. The first problem is formulated as a linear-programming problem, while the latter is approached by an existing heuristic bottom-up aggregation procedure, known as Inter-Cell Traffic Minimization Method (ICTMM), enhanced appropriately.
AB - This paper addresses the problem of manufacturing cell formation, given multiple part routeings, and multiple functionally similar workcentres. Cellular manufacturing is intended to facilitate production, and thus should be based on projected production requirements. The originality of the approach lies in considering both the manufacturing system as well as projected production, and distributing the demand among alternate routeings in order to obtain a better manufacturing cell design. The suggested choice of part routeings favours the decomposition of the manufacturing system into manufacturing cells in a way that minimizes part traffic, along with satisfying the part demand and workcentre capacity constraints. We show that the problem can be formulated as a linear programming type problem which simultaneously addresses two problems: (i) routeing selection, and (ii) cell formation. The common objective is to minimize the inter-cell traffic in the system. The proposed algorithm iteratively solves two problems. The first problem is formulated as a linear-programming problem, while the latter is approached by an existing heuristic bottom-up aggregation procedure, known as Inter-Cell Traffic Minimization Method (ICTMM), enhanced appropriately.
UR - http://www.scopus.com/inward/record.url?scp=84952499845&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84952499845&partnerID=8YFLogxK
U2 - 10.1080/00207549008942864
DO - 10.1080/00207549008942864
M3 - Article
AN - SCOPUS:84952499845
VL - 28
SP - 1243
EP - 1257
JO - International Journal of Production Research
JF - International Journal of Production Research
SN - 0020-7543
IS - 12
ER -