Semi-online scheduling with bounded job sizes on two uniform machines (Q338376): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 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.2016.08.022 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2512747565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for List Schedules on Uniform Processors / 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: Bounds for LPT Schedules on Uniform Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal non-preemptive semi-online scheduling on two related machines / 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: Bin stretching revisited / 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: Semi-online scheduling with ``end of sequence'' information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal preemptive semi-online scheduling on two uniform processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Schedules for Independent Tasks with Similar Execution Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi on-line scheduling on two identical machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The optimal on-line parallel machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling jobs with tightly-grouped processing times on three identical machines / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:47, 12 July 2024

scientific article
Language Label Description Also known as
English
Semi-online scheduling with bounded job sizes on two uniform machines
scientific article

    Statements

    Semi-online scheduling with bounded job sizes on two uniform machines (English)
    0 references
    0 references
    0 references
    4 November 2016
    0 references
    scheduling
    0 references
    uniform machines
    0 references
    semi-online
    0 references
    bounded job sizes
    0 references

    Identifiers