Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods (Q2430608): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q57185730, #quickstatements; #temporary_batch_1712446058616
Property / Wikidata QID
 
Property / Wikidata QID: Q57185730 / rank
 
Normal rank

Revision as of 01:36, 7 April 2024

scientific article
Language Label Description Also known as
English
Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods
scientific article

    Statements

    Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods (English)
    0 references
    0 references
    0 references
    8 April 2011
    0 references
    0 references
    scheduling
    0 references
    parallel machines
    0 references
    total weighted completion time
    0 references
    lower bound
    0 references
    availability constraints
    0 references
    0 references
    0 references