A decomposition Method based on priority rules for a parallel-machine scheduling problem - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 1999

A decomposition Method based on priority rules for a parallel-machine scheduling problem

Résumé

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.
Fichier non déposé

Dates et versions

inria-00098865 , version 1 (26-09-2006)

Identifiants

  • HAL Id : inria-00098865 , version 1

Citer

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, FUCAM, 1999, Glasgow, Scotland, pp.163-172. ⟨inria-00098865⟩
67 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More