Heuristics for the single machine scheduling problem with early and quadratic tardy penalties
Download full text from publisher
CitationsCitations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
- Jorge M. S. Valente, 2007. "Beam search heuristics for the single machine scheduling problem with linear earliness and quadratic tardiness costs," FEP Working Papers 250, Universidade do Porto, Faculdade de Economia do Porto.
More about this item
Keywordsheuristics; scheduling; single machine; early penalties; quadratic tardy penalties; no machine idle time; 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:234. 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 .