Preemptive semi-online algorithms for parallel machine scheduling with known total size (Q2508575): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Semi on-line algorithms for the partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4710111 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-on-line scheduling problems for maximizing the minimum machine completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4709623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive machine covering on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal semi-online preemptive algorithms for machine covering on two uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Deadlines and Loss Functions / rank
 
Normal rank

Latest revision as of 21:44, 24 June 2024

scientific article
Language Label Description Also known as
English
Preemptive semi-online algorithms for parallel machine scheduling with known total size
scientific article

    Statements