A hybrid method for a parallel machine scheduling problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1999

A hybrid method for a parallel machine scheduling problem

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.
Not file

Dates and versions

inria-00108065 , version 1 (19-10-2006)

Identifiers

  • HAL Id : inria-00108065 , version 1

Cite

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⟩
45 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More