Some dominance properties for single-machine tardiness problems with sequence-dependent setup

Some dominance properties for single-machine tardiness problems with sequence-dependent setup

0.00 Avg rating—0 Votes
Article ID: iaor2007664
Country: United Kingdom
Volume: 44
Issue: 17
Start Page Number: 3367
End Page Number: 3378
Publication Date: Jan 2006
Journal: International Journal of Production Research
Authors: , ,
Abstract:

Some dominance properties are proposed for the NP-hard problems of scheduling N jobs on a single machine with due dates, and sequence-dependent setup times. The algorithms based on Ragatz's branch and bound scheme with the dominance properties are developed to minimize the maximum tardiness or the total tardiness. Computational experiments demonstrate the effectiveness of the dominance rules.

Reviews

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