Multiple-machine lower bounds for shop-scheduling problems

Francis Sourd 1 Wim Nuijten
1 SYSDEF - Systèmes d'aide à la décision et à la formation
LIP6 - Laboratoire d'Informatique de Paris 6
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.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01195564
Contributor : Lip6 Publications <>
Submitted on : Tuesday, September 8, 2015 - 10:12:38 AM
Last modification on : Thursday, March 21, 2019 - 1:11:56 PM

Identifiers

Citation

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⟩

Share

Metrics

Record views

71