Minimizing the number of exceptional edges in cellular manufacturing problem

DOI10.1016/J.ENDM.2016.05.040zbMATH Open1347.05152OpenAlexW2507541193MaRDI QIDQ327697FDOQ327697

S. Arumugam, A. Somasundaram, J. Saral

Publication date: 19 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2016.05.040

Recommendations

• A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing
• A method for finding minimal bottle-neck cells for grouping part-machine families†
• Identifying the composition of a cellular manufacturing system
• Models for machine-part grouping in cellular manufacturing
• Finding part-machine families using graph partitioning techniques

zbMATH Keywords

bipartite graphsubdivision graphcellular manufacturing problemexceptional edgepart grouping

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Design of cellular manufacturing systems based on asymptotic forms of a Boolean matrix

This page was built for publication: Minimizing the number of exceptional edges in cellular manufacturing problem

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