LIP6 2000/015

• Reports
  Nouvelles bornes inférieures pour les problèmes d'ateliers
• F. Sourd, W. Nuijten
• 19 pages - 05/31/2000- document en - mailto:sourd@ilog.fr?subject=Rapport LIP6 2000/015 - 125 Ko
• Contact : Francis.Sourd (at) nulllip6.fr
• Ancien Thème : SYSDEF
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.
• Keywords : Shop scheduling problems, lower bounds, branch and bound
• Publisher : Valerie.Mangin (at) nulllip6.fr