Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1135983 | Computers & Industrial Engineering | 2006 | 16 Pages |
Abstract
In this paper, we present dominance conditions for the single machine weighted earliness scheduling problem with no idle time. We also propose an algorithm that can be used to improve upper bounds for the weighted earliness criterion and lower bounds for an earliness/tardiness problem. The computational tests show that the algorithm is superior to an initial heuristic schedule and an existing adjacency condition.
Keywords
Related Topics
Physical Sciences and Engineering
Engineering
Industrial and Manufacturing Engineering
Authors
Jorge M.S. Valente,