Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties
Download full text from publisher
More about this item
Keywordsscheduling; single machine; early/tardy; quadratic penalties; dispatching rules;
NEP fieldsThis paper has been announced in the following NEP Reports:
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:por:fepwps:236. 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: (). General contact details of provider: http://edirc.repec.org/data/fepuppt.html .
We have no references for this item. You can help adding them by using this form .