A Branch and Bound Algorithm to Minimize Total Weighted Tardiness on a Single Processor

Pascal Babu, Laurent Peridy () and Eric Pinson

Annals of Operations Research, 2004, vol. 129, issue 1, 33-46

Abstract: In this paper, we consider the problem of minimizing the total weighted tardiness of a set of jobs processed on a single processor. First, a lower bound based on a Lagrangian decomposition is presented. The particularity of this decomposition, based on a 0–1 time indexed formulation, is to be sensitive to the domain reduction of jobs which are proposed. A branch and bound strategy including these different components is proposed. The results obtained on problems from the literature can be favourably compared to previously works and seem to prove that a trade-off between a tight lower bound and time consuming in the enumeration process can be a good strategy. Copyright Kluwer Academic Publishers 2004

Keywords: scheduling; Lagrangian decomposition; branch & bound (search for similar items in EconPapers)
Date: 2004
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://hdl.handle.net/10.1023/B:ANOR.0000030680.29037.d0 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:129:y:2004:i:1:p:33-46:10.1023/b:anor.0000030680.29037.d0

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/B:ANOR.0000030680.29037.d0

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().