Multiple-machine lower bounds for shop-scheduling problems - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue INFORMS Journal of Computing Année : 2000

Multiple-machine lower bounds for shop-scheduling problems

Wim Nuijten
  • Fonction : Auteur

Résumé

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.
Fichier non déposé

Dates et versions

hal-01195564 , version 1 (08-09-2015)

Identifiants

Citer

Francis Sourd, Wim Nuijten. Multiple-machine lower bounds for shop-scheduling problems. INFORMS Journal of Computing, 2000, 12 (4), pp.341-352. ⟨10.1287/ijoc.12.4.341.11881⟩. ⟨hal-01195564⟩
41 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More