Heuristic for maximizing grouping efficiency in the cell formation problem

DOI10.1007/978-3-319-56829-4_2MaRDI QIDQ3133351zbMATH OpenOpenAlexFDO

Authors Ilya Bychkov, Mikhail Batsyn, Panos M. Pardalos

Publication date 14 February 2018

Published in Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1702.07266

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Abstract computational complexity for mathematical programming problems (90C60)

Abstract: In our paper we consider the Cell Formation Problem in Group Technology with grouping efficiency as an objective function. We present a heuristic approach for obtaining high-quality solutions of the CFP. The suggested heuristic applies an improvement procedure to obtain solutions with high grouping efficiency. This procedure is repeated many times for randomly generated cell configurations. Our computational experiments are performed for popular benchmark instances taken from the literature with sizes from 10x20 to 50x150. Better solutions unknown before are found for 23 instances of the 24 considered.

Recommendations

• Heuristic algorithm for the cell formation problem
• Exact model for the cell formation problem
• A matheuristic for the cell formation problem
• An efficient exact model for the cell formation problem with a variable number of production cells
• Cell formation in group technology: A combinatorial search approach

Cited in

(6)

• A matheuristic for the cell formation problem
• A GRASP heuristic for the manufacturing cell formation problem
• Heuristic algorithm for the cell formation problem
• scientific article; zbMATH DE number 6921271 (Why is no real title available?)
• Exact model for the cell formation problem
• Heuristic rules-based logic cell formation algorithm

This page was built for publication: Heuristic for maximizing grouping efficiency in the cell formation problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3133351)