| Article ID: | iaor20072262 |
| Country: | Netherlands |
| Volume: | 51 |
| Issue: | 4 |
| Start Page Number: | 765 |
| End Page Number: | 780 |
| Publication Date: | Dec 2006 |
| Journal: | Computers & Industrial Engineering |
| Authors: | Valente Jorge M.S. |
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.