# A decomposition Method based on priority rules 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 : In this paper we present 2 heuristics to solve a parallel-machine scheduling problem. The problem consists in determining a feasible schedule where each job is defined by a ready date, a processing time different on each machine and a deadline. There are setup times between jobs; these times depend on the sequence. The set of machines is composed of 2 types. The first one is characterized with cheap'' machines and the second one with expensive'' machines. The objective function is first to find a feasible schedule and second to minimize the cost due to assignment and setup time costs. The heuristics proposed in this paper are based on a decomposition first and on 2 different priority rules second.
Mots-clés :
Type de document :
Communication dans un congrès
Proceedings of the International conference on Industrial Engineering & Production Management - IEPM'99, 1999, Glasgow, Scotland, 1, pp.163-172, 1999
Domaine :

https://hal.inria.fr/inria-00098865
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 08:39:34
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48

### Identifiants

• HAL Id : inria-00098865, version 1

### Citation

Antony Vignier, Benoit Sonntag, Marie-Claude Portmann. A decomposition Method based on priority rules for a parallel-machine scheduling problem. Proceedings of the International conference on Industrial Engineering & Production Management - IEPM'99, 1999, Glasgow, Scotland, 1, pp.163-172, 1999. 〈inria-00098865〉

### Métriques

Consultations de la notice