Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan (Q721932): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Scheduling three chains on two parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling identical jobs with chain precedence constraints on two uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling on identical machines: How good is LPT in an on-line setting? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal scheduling for two-processor systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling chain-structured tasks to minimize makespan and mean flow time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Scheduling of Precedence Constrained Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling of equal-processing-time task systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal online algorithm for scheduling two machines with release times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints / rank
 
Normal rank

Revision as of 05:01, 16 July 2024

scientific article
Language Label Description Also known as
English
Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan
scientific article

    Statements

    Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan (English)
    0 references
    0 references
    0 references
    20 July 2018
    0 references
    0 references
    online algorithm
    0 references
    makespan
    0 references
    chain precedence constraints
    0 references
    competitive ratio
    0 references
    0 references