Using Instance Statistics to Determine the Lookahead Parameter Value in the ATC Dispatch Rule: Making a good heuristic better
The Apparent Tardiness Cost (ATC) heuristic is one of the best performing dispatch rules for the weighted tardiness scheduling problem. This heuristic uses a lookahead parameter whose value must be specified. In this paper we develop a function that maps some instance statistics into an appropriate value for the lookahead parameter. This function is compared with some fixed values that have been previously used. The computational results show that the ATC heuristic performs better when the lookahead parameter value is determined by the proposed function.
|Date of creation:||Apr 2003|
|Contact details of provider:|| Postal: Rua Dr. Roberto Frias, 4200 PORTO|
Web page: http://www.fep.up.pt/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:por:fepwps:127. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ()
If references are entirely missing, you can add them using this form.