Production scheduling and rescheduling with genetic algorithms

  • Authors:
  • Christian Bierwirth;Dirk C. Mattfeld

  • Affiliations:
  • University of Bremen Department of Economics Box 330440 D-28334 Bremen, Germany chris@logistik.uni-bremen.de;University of Bremen Department of Economics Box 330440 D-28334 Bremen, Germany dirk@logistik.uni-bremen.de

  • Venue:
  • Evolutionary Computation
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

A general model for job shop scheduling is described which applies to static, dynamic and non-deterministic production environments. Next, a Genetic Algorithm is presented which solves the job shop scheduling problem. This algorithm is tested in a dynamic environment under different workload situations. Thereby, a highly efficient decoding procedure is proposed which strongly improves the quality of schedules. Finally, this technique is tested for scheduling and rescheduling in a non-deterministic environment. It is shown by experiment that conventional methods of production control are clearly outperformed atreasonable runtime costs.