TY - JOUR

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

AU - Papaioannou, G.

AU - Wilson, J. M.

PY - 2012/10/1

Y1 - 2012/10/1

N2 - 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.

AB - 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.

KW - Cell formation

KW - Mixed integer linear programming

KW - Part allocation

KW - Part machine operation sequence

KW - Tabu search

UR - http://www.scopus.com/inward/record.url?scp=84864768162&partnerID=8YFLogxK

U2 - 10.2478/v10209-011-0008-7

DO - 10.2478/v10209-011-0008-7

M3 - Article

AN - SCOPUS:84864768162

SN - 0867-6356

VL - 37

SP - 97

EP - 127

JO - Foundations of Computing and Decision Sciences

JF - Foundations of Computing and Decision Sciences

IS - 2

ER -