Improved Lower Bounds for the Single Machine Earliness/Tardiness Scheduling Problem with Release Dates

• Type: Article in International Scientific Journal
• Date: 2005

Authors

Jorge M. S. Valente (Author) FEP

Journal

Title: International Journal of Operations Research

Vol. 2

Pages: 9-16

ISSN: 1813-713X

Publisher: Operations Research Society of Taiwan

Scientific classification

FOS: Social sciences > Economics and Business

CORDIS: Social sciences > Economics > Management studies > Production management

Other information

DOI: 10.1057/palgrave.jors.2601865

Abstract (EN): 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 different 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.

Language: English

Type (Professor's evaluation): Scientific