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

R. Mary Jeya Jothi

doi:10.4028/www.scientific.net/AMM.766-767.943

Paper Titles

Computational Intelligence in Optimization of Process Parameters in Turning Metals and Composites – A Review
p.914

Multi Response DEA-Based Taguchi Optimization of Process Parameters on AA8011 Friction Stir Welded Aluminium Alloys
p.921

Quality Improvement of Sugar by Two Factor Factorial Experimentation in Optimization of Quantity of Lime and Sulphur Added in the Juice Sulphitation Process of a Sugar Plant
p.928

Minimizing of Rejection in Cylinder Head Machining Using the Anova Method
p.935

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

Modeling and Analysis of Cutting Force in Turning of AISI 316L Stainless Steel (SS) under Nano Cutting Environment
p.949

Investigation of Particle Segregation and Solidification Time in FGM's Using Centrifuge Casting Technique
p.956

Optimization of Two-Stage Hybrid Flow Shop Scheduling Problems Using Genetic Algorithm
p.962

Optimization of the Location of Secondary Sources for the Active Engine Vibration Acoustic Noise Control in the Generator Room
p.968

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 766-767Applications of Super Strongly Perfect Graph for...

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

Abstract:

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.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 766-767)

Pages:

943-948

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.766-767.943

Citation:

Cite this paper

Online since:

June 2015

Authors:

R. Mary Jeya Jothi*

Keywords:

Double Wheel Graph, Manufacturing System, Super Strongly Perfect Graph, Wheel Graph

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] R. Mary Jeya Jothi, A. Amutha, Proceedings of an International Conference on Soft Computing for Problem Solving (Soc Pros 2012), Springer publications, 1604 (2014) 279 - 286.

Google Scholar

[2] R. Mary Jeya Jothi. R, A. Amutha, An introduction to the family members of the architecture Super Strongly Perfect Graph (SSP), IEEE Xplore, (2011) 1087-1091.

DOI: 10.1109/icetect.2011.5760280

Google Scholar

[3] C. Berge, Graphs and Hyper graphs, North Holland Amsterdam, (1973).

Google Scholar

[4] Oystein Ore, Theory of Graphs, a Text book, American Mathematical Society, Colloquium Publications, 38, (1962).

Google Scholar

[5] S. Pemmaraj, S. Skiena, Cycles, Stars and Wheels, Computational Discrete Mathematics - Combinatorics and Graph Theory in Mathematica, Cambridge University Press Cambridge, England, 2003, pp.248-249.

Google Scholar

[6] Varinder Singh , P.M. Singru, Analysis of restructuring a manufacturing system using graph theoretic model, Journal of Manufacturing Technology Management, 24 (2013) 615 - 636.

DOI: 10.1108/17410381311327422

Google Scholar

[7] L. Dobrjanskyj and F. Freudenstein, Some Applications of Graph Theory to the Structural Analysis of Mechanisms, J. Manuf. Sci. Eng., 89 (1967), 153-158.

DOI: 10.1115/1.3609988

Google Scholar