HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

A hybrid method for a parallel machine scheduling problem

Antony Vignier 1 Benoit Sonntag 1 Marie-Claude Portmann 1
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.
Document type :
Conference papers
Complete list of metadata

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


  • HAL Id : inria-00108065, version 1



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, IEEE, 1999, Barcelona, Spain, pp.671-678. ⟨inria-00108065⟩



Record views