Insights into two solution procedures for the single machine tardiness problem

Insights into two solution procedures for the single machine tardiness problem

0.00 Avg rating0 Votes
Article ID: iaor2003951
Country: United Kingdom
Volume: 53
Issue: 7
Start Page Number: 800
End Page Number: 806
Publication Date: Jul 2002
Journal: Journal of the Operational Research Society
Authors: , ,
Abstract:

This paper explores the well-known modified due date (MDD) rule for minimizing total tardiness on a single machine and shows that it has a decomposition structure. Based on this finding, we propose a decomposition heuristic and draw parallels to the famous optimal decomposition algorithm. We demonstrate that the MDD rule and the decomposition algorithm have striking similarities. We also discuss the key differences between these procedures. Finally, we present a sufficient condition under which the MDD rule is optimal and conclude the paper with some directions for future research.

Reviews

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