A genetic algorithm to achieve scheduling flexibility for a single machine problem

We consider single machine scheduling problem with dynamic job arrival and total weighted tardiness and makespan as objective functions. The machine is subject to disruptions related to late raw material arrival and machine breakdowns. We propose a proactive-reactive approach to deal with possible p...

Full description

Saved in:
Bibliographic Details
Published inR.A.I.R.O. Recherche opérationnelle
Main Authors Aloulou, Mohamed Ali, Portmann, Marie-Claude
Format Journal Article
LanguageEnglish
Published EDP Sciences 2002
Subjects
Computer Science
Other
total weighted tardiness
flexibility
flexibilité
algorithmes génétiques
ordonnancement
single machine
somme pondérée des retards
scheduling
une machine
genetic algorithms
Online AccessGet full text
ISSN0399-0559
1290-3868

Cover

More Information
Summary:We consider single machine scheduling problem with dynamic job arrival and total weighted tardiness and makespan as objective functions. The machine is subject to disruptions related to late raw material arrival and machine breakdowns. We propose a proactive-reactive approach to deal with possible perturbations. In the proactive phase, instead of providing only one schedule to the decision maker, we present a set of predictive schedules. This set is characterized by a partial order of jobs and a type of associated schedules, here semi-active schedules. This allows to dispose of some flexibility in job sequencing and flexibility in time that can be used on-line by the reactive algorithm to hedge against unforseen disruptions. In this paper, we focus on the proactive algorithm, which is based on a genetic algorithm and present some experimentations to validate that this algorithm is able, in several cases, to compute solutions (partial orders of jobs) that provide some flexibility while maintaining high shop performance.
ISSN:0399-0559
1290-3868