Jorge M. S. Valente () (Faculdade de Economia, Universidade 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.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
file. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Universidade do Porto, Faculdade de Economia do Porto in its series FEP Working Papers with number
156.
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.: