Design of Manufacturing Cells Based on Graph Theory

Design of Manufacturing Cells Based on Graph Theory

José Francisco Ferreira Ribeiro (University of São Paulo, Brazil)
DOI: 10.4018/978-1-61350-047-7.ch004
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

In this chapter a comparative study is presented between (I) sequential heuristics, (II) simulated annealing, (III) tabu search, and (IV) threshold algorithm for graph coloring and its application for solving the problem of the design of manufacturing cells in a job shop system production. The job shop production system has a very large proportion of all manufacturing activity. The principal concepts of manufacturing cells, graph theory, and heuristics are presented. The results obtained with these algorithms on several examples found in the literature are consistently equivalent with the best solution hitherto known in terms of numbers of inter-cell moves and dimensions of cells.
Chapter Preview
Top

Background

A large number of techniques have been used in recent years (Sing, 1993) to hit the block-diagonalization of the matrix, designing manufacturing cells and implementing Group Technology in the industries. For example:

Complete Chapter List

Search this Book:
Reset