# A hybrid method for a parallel machine scheduling problem

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 :
Type de document :
Communication dans un congrès
International Conference on Emerging Technologies on Factory & Automation - ETFA'99, 1999, Barcelona, Spain, 1, pp.671-678, 1999
Domaine :

https://hal.inria.fr/inria-00108065
Contributeur : Publications Loria <>
Soumis le : jeudi 19 octobre 2006 - 15:40:39
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48

### Identifiants

• HAL Id : inria-00108065, version 1

### Citation

Antony Vignier, Benoit Sonntag, Marie-Claude Portmann. A hybrid method for a parallel machine scheduling problem. International Conference on Emerging Technologies on Factory & Automation - ETFA'99, 1999, Barcelona, Spain, 1, pp.671-678, 1999. 〈inria-00108065〉

### Métriques

Consultations de la notice