Multiple-machine lower bounds for shop-scheduling problems

Multiple-machine lower bounds for shop-scheduling problems

0.00 Avg rating0 Votes
Article ID: iaor20012766
Country: United States
Volume: 12
Issue: 4
Start Page Number: 341
End Page Number: 352
Publication Date: Sep 2000
Journal: INFORMS Journal On Computing
Authors: ,
Keywords: programming: integer
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.

Reviews

Required fields are marked *. Your email address will not be published.