A new branch-&-bound-enhanced genetic algorithm for the manufacturing cell formation problem |
| |
Authors: | Menouar Boulif Karim Atif |
| |
Affiliation: | 1. Département d’Informatique, Université M’hamed Bouguerra à Boumerdès, Avenue de l’indépendance, 35000 Boumerdès, Algerie;2. Département d’Informatique, ITS, Université des Sciences et de la Technologie Houari Boumedienne, BP 32, El-Alia, 16111 Babezzouar, Alger, Algerie |
| |
Abstract: | This paper deals with the manufacturing cell formation (MCF) problem, which is based on group technology principles, using a graph partitioning formulation. An attempt has been made to take into account the natural constraints of real-life production systems, such as operation sequences, minimum and maximum numbers of cells, and maximum cell sizes. Cohabitation constraints were added to the proposed model in order to deal with the necessity of grouping certain machines in the same cell for technical reasons, and non-cohabitation constraints were included to prevent placing certain machines in close vicinity. |
| |
Keywords: | Manufacturing cell formation Graph partitioning Genetic algorithm Branch & bound |
本文献已被 ScienceDirect 等数据库收录! |
|