Minimizing the number of exceptional edges in cellular manufacturing problem

DOI10.1016/J.ENDM.2016.05.040MaRDI QIDQ327697zbMATH OpenOpenAlexFDO

Authors S. Arumugam, J. Saral, A. Somasundaram

Publication date 19 October 2016

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

zbMATH Keywords

bipartite graphcellular manufacturing problemexceptional edgepart groupingsubdivision graph

Mathematics Subject Classification ID

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

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

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)