<abstract xmlns="http://www.w3.org/1999/xhtml"><p>This paper presents extensions of the IP model where part-machine assignment and cell formation are addressed simultaneously and part machine utilisation is considered. More specifically, an integration of inter-cell movements of parts and machine set-up costs within the objective function, and also a combination of machine set-up costs associated with parts revisiting a cell when the part machine operation sequence is taken into account are examined and an enhanced model is formulated. Based upon this model’s requirements, an initial three stage approach is proposed and a tabu search iterative procedure is designed to produce a solution. The initial approach consists of the allocation of machines to cells, the allocation of parts to machines in cells and the evaluation of the objective function’s value. Special care has been taken when allocating parts to machine cells as part machine operation sequence is preserved making the system more complex but more realistic. The proposed tabu search algorithm integrates short term memory and an overall iterative searching strategy where two move types, single and exchange, are considered. Computational experiments verified both the algorithm’s robustness where promising solutions in reasonably short computational effort are produced and also the algorithm’s effectiveness for large scale data sets.</p></abstract>

This paper presents extensions of the IP model where part-machine assignment and cell formation are addressed simultaneously and part machine utilisation is considered. More specifically, an integration of inter-cell movements of parts and machine set-up costs within the objective function, and also a combination of machine set-up costs associated with parts revisiting a cell when the part machine operation sequence is taken into account are examined and an enhanced model is formulated. Based upon this model’s requirements, an initial three stage approach is proposed and a tabu search iterative procedure is designed to produce a solution. The initial approach consists of the allocation of machines to cells, the allocation of parts to machines in cells and the evaluation of the objective function’s value. Special care has been taken when allocating parts to machine cells as part machine operation sequence is preserved making the system more complex but more realistic. The proposed tabu search algorithm integrates short term memory and an overall iterative searching strategy where two move types, single and exchange, are considered. Computational experiments verified both the algorithm’s robustness where promising solutions in reasonably short computational effort are produced and also the algorithm’s effectiveness for large scale data sets.

A tabu search algorithm for the cell formation problem with part machine sequencing

School of Business & Economics, Loughborough University, Loughborough, LE11 3TU, UK

School of Management & Business, Aberystwyth University, Aberystwyth, SY23 3DD

Foundations of Computing and Decision Sciences

This paper presents extensions of the IP model where part-machine assignment and cell formation are addressed simultaneously and part machine utilisation is...

A tabu search algorithm for the cell formation problem with part machine sequencing

Publié en ligne: 01 oct. 2012

Pages: 97 - 127

DOI: https://doi.org/10.2478/v10209-011-0008-7

Mots clés
cell formation, mixed integer linear programming, tabu search, part allocation, part machine operation sequence

This content is open access.

A tabu search algorithm for the cell formation problem with part machine sequencing

Publié en ligne: 01 oct. 2012

Pages: 97 - 127

DOI: https://doi.org/10.2478/v10209-011-0008-7

Mots cléscell formation, mixed integer linear programming, tabu search, part allocation, part machine operation sequence

This content is open access.

Mots clés
cell formation, mixed integer linear programming, tabu search, part allocation, part machine operation sequence