On the single-machine scheduling problem with tardiness penalties

On the single-machine scheduling problem with tardiness penalties

0.00 Avg rating0 Votes
Article ID: iaor1992522
Country: United Kingdom
Volume: 42
Issue: 8
Start Page Number: 695
End Page Number: 702
Publication Date: Aug 1991
Journal: Journal of the Operational Research Society
Authors: ,
Abstract:

The n-job, single-machine total tardiness problem is considered in this paper. A branching algorithm based on three theorems is proposed to generate a reduced set of candidate sequences. The computational results indicate that the proposed algorithm provides a smaller set of candidate sequences than the DP algorithm of Schrage and Baker.

Reviews

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