Graph partitioning procedure for machine assignment and cell formation in group technology

Ronald Askin, Kuohung Simon Chiu

Research output: Contribution to journalArticle

107 Citations (Scopus)

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 languageEnglish (US)
Pages (from-to)1555-1572
Number of pages18
JournalInternational Journal of Production Research
Volume28
Issue number8
StatePublished - Aug 1990

Fingerprint

Group technology
Depreciation
Mathematical programming
Materials handling
Mathematical models
Economics
Costs
Cell formation
Assignment
Partitioning
Graph

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 journalArticle

@article{7ad65891673d4bd58d3be9ce34e5b412,
title = "Graph partitioning procedure for machine assignment and cell formation in group technology",
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.",
author = "Ronald Askin and Chiu, {Kuohung Simon}",
year = "1990",
month = "8",
language = "English (US)",
volume = "28",
pages = "1555--1572",
journal = "International Journal of Production Research",
issn = "0020-7543",
publisher = "Taylor and Francis Ltd.",
number = "8",

}

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

AN - SCOPUS:0025476266

VL - 28

SP - 1555

EP - 1572

JO - International Journal of Production Research

JF - International Journal of Production Research

SN - 0020-7543

IS - 8

ER -