Abstract
This paper proposes a mathematical model and solution procedure for the group technology configuration problem - the grouping of individual machines into cells and the routing of components to machines within cells. Costs of inventory, machine depreciation, machine setup and material handling are first incorporated into a mathematical programming formulation. The formulation is then divided into two subproblems to facilitate solution. A heuristic graph partitioning procedure is then proposed for each subproblem. The first subproblem assigns components to specific machines. The second subproblem groups machines into cells. An approach for determining economic batch sizes in the environment is also included. Examples are included and the flexibility of the approach to various environments is discussed.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 1555-1572 |
| Number of pages | 18 |
| Journal | International Journal of Production Research |
| Volume | 28 |
| Issue number | 8 |
| State | Published - Aug 1990 |
Fingerprint
ASJC Scopus subject areas
- Management Science and Operations Research
Cite this
Graph partitioning procedure for machine assignment and cell formation in group technology. / Askin, Ronald; Chiu, Kuohung Simon.
In: International Journal of Production Research, Vol. 28, No. 8, 08.1990, p. 1555-1572.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Graph partitioning procedure for machine assignment and cell formation in group technology
AU - Askin, Ronald
AU - Chiu, Kuohung Simon
PY - 1990/8
Y1 - 1990/8
N2 - This paper proposes a mathematical model and solution procedure for the group technology configuration problem - the grouping of individual machines into cells and the routing of components to machines within cells. Costs of inventory, machine depreciation, machine setup and material handling are first incorporated into a mathematical programming formulation. The formulation is then divided into two subproblems to facilitate solution. A heuristic graph partitioning procedure is then proposed for each subproblem. The first subproblem assigns components to specific machines. The second subproblem groups machines into cells. An approach for determining economic batch sizes in the environment is also included. Examples are included and the flexibility of the approach to various environments is discussed.
AB - This paper proposes a mathematical model and solution procedure for the group technology configuration problem - the grouping of individual machines into cells and the routing of components to machines within cells. Costs of inventory, machine depreciation, machine setup and material handling are first incorporated into a mathematical programming formulation. The formulation is then divided into two subproblems to facilitate solution. A heuristic graph partitioning procedure is then proposed for each subproblem. The first subproblem assigns components to specific machines. The second subproblem groups machines into cells. An approach for determining economic batch sizes in the environment is also included. Examples are included and the flexibility of the approach to various environments is discussed.
UR - http://www.scopus.com/inward/record.url?scp=0025476266&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0025476266&partnerID=8YFLogxK
M3 - Article
VL - 28
SP - 1555
EP - 1572
JO - International Journal of Production Research
JF - International Journal of Production Research
SN - 0020-7543
IS - 8
ER -