 |
Bounds for the m-machine scheduling problem
1 : Heuristique et Diagnostic des Systèmes Complexes [Compiègne]
Université de Technologie de Compiègne, Centre National de la Recherche Scientifique : UMR7253
UTC, CS 60319 - 57 avenue de Landshut - 60203 Compiègne cedex -
France
2 : ESIEE PARIS
Univ Gustave Eiffel
3 : Heuristique et Diagnostic des Systèmes Complexes [Compiègne]
Université de Technologie de Compiègne, UMR CNRS 7253, Heudiasyc
4 : Laboratoire Angevin de Recherches en Ingénierie des Systèmes
(LARIS)
PRES Université Nantes Angers Le Mans [UNAM] : EA4094
62, avenue notre Dame du Lac 49000 ANGERS -
France
5 : Institut de Mathématiques Appliquées
(UCO)
PRES Université Nantes Angers Le Mans [UNAM] : EA4094
3 Place André Leroy 49008 Angers -
France
The aim of this talk is to present some new results on constructive and destructive bounds for the m-machine scheduling problem. Recently we have characterized mathematically the three main constructive bounds which are the preemptive bound, the energetic bound and the JPPS makespan. These characterizations give insights to their similarities and differences. It explains why these bounds are generally equal in practice.
