Improved Lower Bounds for the Early/Tardy Scheduling Problem with No Idle Time
In this paper we consider the single machine earliness/tardiness scheduling problem with no idle time. Two of the lower bounds previously developed for this problem are based on lagrangean relaxation and the multiplier adjustment method, and require an initial sequence. We investigate the sensitivity of the lower bounds to the initial sequence, and experiment with di?erent dispatch rules and some dominance conditions. The computational results show that it is possible to obtain improved lower bounds by using a better initial sequence. The lower bounds are also incorporated in a branch-and-bound algorithm, and the computational tests show that one of the new lower bounds has the best performance for larger instances.
|Date of creation:||Apr 2003|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.fep.up.pt/
More information through EDIRC
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.:
- Jorge M. S. Valente & Rui A. F. S. Alves, 2003. "Improved Heuristics for the Early/Tardy Scheduling Problem with No Idle Time," FEP Working Papers 126, Universidade do Porto, Faculdade de Economia do Porto.
When requesting a correction, please mention this item's handle: RePEc:por:fepwps:125. 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: ()
If references are entirely missing, you can add them using this form.