Lower Bounds for Scheduling on Identical Parallel Machines with Heads and Tails

Mohamed Haouari () and Anis Gharbi

Annals of Operations Research, 2004, vol. 129, issue 1, 187-204

Abstract: In this paper, we investigate new lower bounds for the P|r j ,q j |C max scheduling problem. A new bin packing based lower bound, as well as several new lifting procedures are derived for this strongly NP -hard problem. Extensive numerical experiments show that the proposed lower bounds consistently outperform the best existing ones. Copyright Kluwer Academic Publishers 2004

Keywords: scheduling; identical parallel machines; release dates; delivery times; makespan; lower bound (search for similar items in EconPapers)
Date: 2004
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://hdl.handle.net/10.1023/B:ANOR.0000030688.31785.40 (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:187-204:10.1023/b:anor.0000030688.31785.40

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

DOI: 10.1023/B:ANOR.0000030688.31785.40

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 ().