A hybrid method for a parallel machine scheduling problem

Antony Vignier; Benoit Sonntag; Marie-Claude Portmann

Conference papers

A hybrid method for a parallel machine scheduling problem

Antony Vignier ¹ Benoit Sonntag ¹ Marie-Claude Portmann ¹

1 MACSI - Industrial system modeling, analysis and operation

INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications

Abstract : The scheduling problem dealt with in this paper consists in determining a feasible schedule when each job is defined with a ready date, a processing time different on each machine and a deadline. There are setup time sequence dependent. The parallel machines are composed of 2 types. The first one is characterized with ``cheap'' machines and the second one with ``expensive'' machines. The objective function is to find a feasible schedule first and to minimize the cost due to assignment and setup times costs second. The method presented in this paper is based on a three-phase heuristic. The first phase is based on an iterative heuristic, the second on a genetic algorithm and the last one on a branch and bound for post optimization.

Mots-clés : algorithme génétique decomposition method genetic algorithm parallel machine scheduling machines parallèles ordonnancement méthode par décomposition

Document type :

Conference papers

Domain :

Computer Science [cs] / Other [cs.OH]

Complete list of metadata

https://hal.inria.fr/inria-00108065
Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Thursday, October 19, 2006 - 3:40:39 PM
Last modification on : Friday, February 4, 2022 - 3:30:21 AM

A hybrid method for a parallel machine scheduling problem

Identifiers

Collections

Citation

Export

Metrics

45

Contact Legal Notice Personal Data

A hybrid method for a parallel machine scheduling problem

Identifiers

Collections

Citation

Export

Share

Metrics

45

Contact Legal Notice Personal Data