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

Post-Print from HAL

Date: 2010
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Published in Annals of Operations Research, 2010, 181 (1), pp.359-375

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
Journal Article: 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:hal:journl:hal-00572976

Access Statistics for this paper

More papers in Post-Print from HAL
Bibliographic data for series maintained by CCSD ().