Lower bounds for parallel machine scheduling problems

Philippe Baptiste, Antoine Jouglet and David Savourey

International Journal of Operational Research, 2008, vol. 3, issue 6, 643-664

Abstract: We study the parallel machine scheduling problem with release dates and consider several 'min-sum' objective functions including total weighted tardiness, total tardiness, total weighted completion time and total completion time. We describe several lower bounds for these problems, most of them being original ones. We provide experimental results to compare these lower bounds according to their quality and of their computational time requirement.

Keywords: identical parallel machines; lower bounds; parallel machine scheduling; total cost; release dates. (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.inderscience.com/link.php?id=19731 (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:ids:ijores:v:3:y:2008:i:6:p:643-664

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().