Manufacturing cell scheduling using genetic algorithms

Abstract

This paper presents a new approach to the scheduling of manufacturing cells which havē ow-shop con®guration. The approach is based on the genetic algorithm, which is a meta-heuristic for solving combinatorial optimization problems. The performance measure demonstrated in this paper is the optimization of the mean¯ow time. The procedure developed automatically computes the make-span. A¯exible manufacturing cell schedule is used as a case study. The genetic algorithm procedure was used to solve a published data set for simple scheduling problems. The genetic algorithm procedure was further used to solve large¯ow-shop scheduling problems having machine sizes of up to 30 and job sizes of up to 100 in very reasonable computation time. The results show that the genetic-algorithm-based heuristic is promising for scheduling manufacturing cells.

Tool requirement and pre-scheduling optimization model of the tool flow system of a digital workshop

“…The genetic algorithm is a population type of operation algorithm, in which a certain number of chromosomes can be generated after encoding the variables of the solution space to construct the initial population of the genetic algorithm. 21 The static tool requirements need to be calculated for the input scheduling tasks considered in this article. A tool should then be added to each tool type.…”

A Paradigm for the Scheduling of a Continuous Walking Beam Reheat Furnace Using a Modified Genetic Algorithm

“…For example, GAs have been used to schedule flowshops [16,17], jobshops [18], water supplies [19], university class timetabling [20], and nurse working shifts [21].…”

Applying genetic algorithms for programming manufacturing cell tasks

“…Los primeros esfuerzos han sido desarrollados por Johnson (1954), Kusiak(1989) tomó los desarrollos de Johnson en donde incluye las tripletas número de operación/tiempo de proceso/número de máquina, Campbell, Dudek y Smith (CDS) (Vollmann, 1997), en donde se toman los trabajos realizados por Johnson y se modifica el trabajo de aquél para varias pseudo máquinas; el trabajo de Onwubolu (2000), toma los conceptos de algoritmos genéticos para hallar makespan de una celda de manufactura. A lo largo del artículo se presentarán algunos otros autores que se toman como referencia…”

“…Los resultados ofrecen una buena aproximación frente a otras heurísticas, como es el caso de la aleatoria, la CDS (Vollmann, 1997) y la propuesta por Onwubolu (Onwubolu, 2000).…”