A hybrid decomposition approach using increasing clusters for solving scheduling problems with minimal and maximal time lags - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

A hybrid decomposition approach using increasing clusters for solving scheduling problems with minimal and maximal time lags

Abstract

In this article we present a priority rule construction algorithm couopled with a cluster decomposition method in order to construct feasible solutions for general scheduling problems with minimal and maximal time lag constraints. Algorithm performances have been tested on job shop scheduling problems and also a real chemical freeze-drying process.
Fichier principal
Vignette du fichier
Deppner-Portmann_PMS_2006.pdf (338.25 Ko) Télécharger le fichier

Dates and versions

inria-00114183 , version 1 (15-11-2008)

Identifiers

  • HAL Id : inria-00114183 , version 1

Cite

Freddy Deppner, Marie-Claude Portmann. A hybrid decomposition approach using increasing clusters for solving scheduling problems with minimal and maximal time lags. Tenth International Workshop on Project Management and Scheduling (PMS 2006), EURO & University of Poznan, Apr 2006, Poznan/Poland, 4 p. ⟨inria-00114183⟩
84 View
84 Download

Share

Gmail Facebook X LinkedIn More