Resolve the cell formation problem in a set of three manufacturing cells
- Published
- Accepted
- Subject Areas
- Adaptive and Self-Organizing Systems, Algorithms and Analysis of Algorithms, Autonomous Systems, Optimization Theory and Computation, Programming Languages
- Keywords
- Constraint Programming, Cell Formation Problems, Manufacturing Cell Design Model, Global Optimisation, Minizinc
- Copyright
- © 2019 Almonacid
- Licence
- This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, reproduction and adaptation in any medium and for any purpose provided that it is properly attributed. For attribution, the original author(s), title, publication source (PeerJ Preprints) and either DOI or URL of the article must be cited.
- Cite this article
- 2019. Resolve the cell formation problem in a set of three manufacturing cells. PeerJ Preprints 7:e27692v1 https://doi.org/10.7287/peerj.preprints.27692v1
Abstract
The problem of cell formation is an NP-Hard problem, which consists of organising a group of machines and pieces in several cells. The machines are arranged in a fixed way inside the cells, and each machine has some manufacturing operation that applies in different pieces or parts. The idea of the problem is to be able to minimise the movements made by the pieces to reach the machines in the cells. For this problem, a data set has been organised using three manufacturing cells. Through the data set an experiment has been carried out that focuses on obtaining the best solution using a global search solution within 6 days for each instance. The experimental results have been able to obtain the general optimum value for a set of test instances.
Author Comment
This is a preprint submission to PeerJ Preprints.