Applications of Super Strongly Perfect Graph for Manufacturing System towards a Leaner Structure

Some restructuring decisions are conceptualized which reflect the aim of the organization to gradually evolve the manufacturing system towards a leaner structure. This is done by way of defining simplified process so that lesser hindrance in terms of cycles of interactions is found. The reframing decisions are given by five restructured configurations of the manufacturing system. Models using graph theory are developed for original configuration and each of the new reframed configurations and the resulting structural characterization information is used to compare the structure of restructured configurations with the original configuration. A graph G is Super Strongly Perfect (SSP) if every induced sub graph H of G possesses a minimal dominating set that meets all the maximal cliques of H. A study on some classes of super strongly perfect graphs like wheel and double wheel graphs (in which each graph represents structure of some manufacturing system) are given.