Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods

Rabia Nessah () and Chengbin Chu ()

Annals of Operations Research, 2010, vol. 181, issue 1, 359-375

Abstract: This paper addresses an identical parallel machine scheduling problem with job release dates and unavailability periods to minimize total weighted completion time. This problem is known to be NP-hard in the strong sense. We propose a new lower bound that can be computed in polynomial time. The test on more than 8 400 randomly generated instances shows a very significant improvement with respect to existing results for previously studied special cases: without unavailability constraints, unweighted version, or identical job release dates. For instance, the average improvement for the unweighted problem is as much as 20.43% for 2 machines, 53.03% for 7 machines and 66.70% for 15 machines. For some instances, the improvement can be even as much as 93%. Copyright Springer Science+Business Media, LLC 2010

Keywords: Scheduling; Parallel machines; Total weighted completion time; Lower bound; Availability constraints (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-010-0752-8 (text/html)
Access to full text is restricted to subscribers.

Related works:
Working Paper: Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods (2010)
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:181:y:2010:i:1:p:359-375:10.1007/s10479-010-0752-8

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

DOI: 10.1007/s10479-010-0752-8

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