Optimal algorithm for semi-online scheduling on two machines under GoS levels (Q5963701): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Semi-online hierarchical scheduling problems with buffer or rearrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling under a grade of service provision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal online algorithms for scheduling on two identical machines under a grade of service / rank
 
Normal rank
Property / cites work
 
Property / cites work: An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling with two GoS levels and unit processing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online and semi-online scheduling of two machines under a grade of service provision / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comment on parallel-machine scheduling under a grade of service provision to minimize makespan / rank
 
Normal rank

Revision as of 11:04, 11 July 2024

scientific article; zbMATH DE number 6544390
Language Label Description Also known as
English
Optimal algorithm for semi-online scheduling on two machines under GoS levels
scientific article; zbMATH DE number 6544390

    Statements

    Identifiers