Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraint (Q719260): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57185691, #quickstatements; #temporary_batch_1707161894653
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1288472
Property / author
 
Property / author: Yin-Feng Xu / rank
Normal rank
 

Revision as of 21:57, 22 February 2024

scientific article
Language Label Description Also known as
English
Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraint
scientific article

    Statements

    Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraint (English)
    0 references
    0 references
    0 references
    0 references
    10 October 2011
    0 references
    online scheduling
    0 references
    makespan
    0 references
    competitive analysis
    0 references
    parallel machines
    0 references
    periodic availability constraint
    0 references

    Identifiers