On solving manufacturing cell formation via bicluster editing
From MaRDI portal
Publication:323416
DOI10.1016/j.ejor.2016.05.010zbMath1346.90791arXiv1312.3288OpenAlexW136751617MaRDI QIDQ323416
Fábio Protti, Anand Subramanian, Luidi Simonetti, Rian Gabriel S. Pinheiro, Luiz Satoru Ochi, Ivan César Martins
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.3288
Programming involving graphs or networks (90C35) Production models (90B30) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (6)
An efficient exact model for the cell formation problem with a variable number of production cells ⋮ Faster parameterized algorithm for \textsc{Bicluster Editing} ⋮ Minimizing makespan of stochastic customer orders in cellular manufacturing systems with parallel machines ⋮ A matheuristic for the cell formation problem ⋮ Even better fixed-parameter algorithms for bicluster editing ⋮ The biclique partitioning polytope
Cites Work
- Unnamed Item
- Unnamed Item
- Exact model for the cell formation problem
- Cell formation in industrial engineering. Theory, algorithms and experiments
- A water flow-like algorithm for manufacturing cell formation problems
- Machine-part cell formation using biclustering
- Biclique completion problems for multicast network design
- Hybrid Metaheuristic for Bicluster Editing Problem
- Dynamic Programming Treatment of the Travelling Salesman Problem
- Applying Modular Decomposition to Parameterized Bicluster Editing
- Improved Algorithms for Bicluster Editing
- ZODIAC—an algorithm for concurrent formation of part-families and machine-cells
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- On Nonlinear Fractional Programming
- Random Graphs
This page was built for publication: On solving manufacturing cell formation via bicluster editing
