Evolutionary Algorithms For Resource Constrained Non-Serial Mixed Flow Shops

In this paper the resource-constrained flow shop (RCF) problem is addressed. A number of realistic extensions are incorporated, including non-serial precedence requirements, mixed flow shop situations, and the distribution of the human workforce among a number of pre-determined groups. The RCF is then solved by meta-heuristics, primarily of the evolutionary type. An extensive numerical investigation, including a case study of a particular industrial situation, details the implementation and execution of the heuristics, and the efficiency of the proposed algorithms.

[1]  Riyaz Sikora,et al.  A genetic algorithm for integrating lot-sizing and sequencing in scheduling a capacitated flow line , 1996 .

[2]  H. Ishibuchi,et al.  Multi-objective genetic algorithm and its applications to flowshop scheduling , 1996 .

[3]  I. Osman,et al.  Simulated annealing for permutation flow-shop scheduling , 1989 .

[4]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[5]  S. S. Panwalkar,et al.  The Lessons of Flowshop Scheduling Research , 1992, Oper. Res..

[6]  Robert L. Burdett.  Sequencing and scheduling theory for mixed-model multi-stage assembly environment , 2001 .

[7]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

[8]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[9]  Christos Koulamas,et al.  A new constructive heuristic for the flowshop scheduling problem , 1998, Eur. J. Oper. Res..

[10]  Joseph B. Mazzola,et al.  Flow Shop Scheduling with Resource Flexibility , 1994, Oper. Res..

[11]  Rainer Storn,et al.  Differential Evolution-A simple evolution strategy for fast optimization , 1997 .

[12]  Soumen Ghosh,et al.  A comprehensive literature review and analysis of the design, balancing and scheduling of assembly systems , 1989 .

[13]  Robert L. Burdett,et al.  Evolutionary algorithms for flowshop sequencing with non‐unique jobs , 2000 .

[14]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

[15]  David K. Smith,et al.  The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem , 1990, Comput. Oper. Res..

[16]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

[17]  Adam Janiak,et al.  Genetic algorithm for the permutation flow-shopscheduling problem with linear models of operations , 1998, Ann. Oper. Res..

[18]  A. Hertz,et al.  A new heuristic method for the flow shop sequencing problem , 1989 .