Local and global dominance conditions for the weighted earliness scheduling problem with no idle time

Jorge M. S. Valente ()
Additional contact information
Jorge M. S. Valente: Faculdade de Economia, Universidade do Porto.

FEP Working Papers from Universidade do Porto, Faculdade de Economia do Porto

Abstract: In this paper, we present several local and global dominance conditions for the single machine weighted earliness scheduling problem with no idle time. We also propose an improvement algorithm that uses these conditions and can be applied to improve the sequence given by a heuristic procedure. This algorithm can be used to improve not only upper bounds for the weighted earliness criterion, but also lower bounds for the earliness/tardiness scheduling problem. The computational tests show that, in both of these cases, the improvement algorithm is superior to an initial heuristic schedule, as well as an existing adjacency condition.

Keywords: scheduling; weighted earliness; dominance rules (search for similar items in EconPapers)
Pages: 21 pages.
Date: 2004-09
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.fep.up.pt/investigacao/workingpapers/04.09.14_WP156_Jorge.pdf (application/pdf)
Our link check indicates that this URL is bad, the error code is: 404 Not Found (http://www.fep.up.pt/investigacao/workingpapers/04.09.14_WP156_Jorge.pdf [302 Found]--> https://fep.up.pt/investigacao/workingpapers/04.09.14_WP156_Jorge.pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:por:fepwps:156

Access Statistics for this paper

More papers in FEP Working Papers from Universidade do Porto, Faculdade de Economia do Porto Contact information at EDIRC.
Bibliographic data for series maintained by ().