Rapport de Recherche LIP6 /
19 pages - Mai/May 2000 - Document en anglais.
Get it : 122 Ko /Kb
Contact : par mail / e-mail
Thème/Team: Systèmes d'Aide à la Décision et à la Formation
Titre français : Nouvelles bornes inférieures pour les problèmes d'ateliers
Titre anglais : Multiple-Machine Lower Bounds for Shop Scheduling Problems
Abstract : In order to compute lower bounds for shop scheduling problems, a lot of attention has been paid to adjustment techniques based on one-machine relaxations. We present such a new technique but, following the observation that machines are connected to each other through precedence constraints, we also study techniques that are based on the combination of precedence constraints and disjunctive constraints between operations that are processed on different machines. A computational study of the effectiveness of these new techniques is performed on job shop and flow shop instances.
Published in INFORMS Journal of Computing 12 (vol. 4) 2000.
Key-words : Shop scheduling problems, lower bounds, branch and bound
Publications internes LIP6 2000 / LIP6 research reports 2000
Responsable Éditorial / Editor :Valerie.Mangin@lip6.fr