Semi-online scheduling problems on two uniform machines under a grade of service provision (Q388114): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2013.04.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2086788249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling on two uniform processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling on two uniform machines with the known largest size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling with known maximum job size on two uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin stretching revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized on-line scheduling on two uniform machines / 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: Two semi-online scheduling problems on two uniform machines / 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 note on hierarchical scheduling on two uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Semi-online Scheduling Algorithms on Two Parallel Identical Machines under a Grade of Service Provision / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:49, 7 July 2024

scientific article
Language Label Description Also known as
English
Semi-online scheduling problems on two uniform machines under a grade of service provision
scientific article

    Statements

    Semi-online scheduling problems on two uniform machines under a grade of service provision (English)
    0 references
    0 references
    0 references
    19 December 2013
    0 references
    scheduling
    0 references
    uniform machine
    0 references
    grade of service
    0 references
    semi-online
    0 references
    competitive ratio
    0 references

    Identifiers