Semi-online preemptive scheduling: one algorithm for all variants (Q537921): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00224-010-9287-2 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5898937 / rank
 
Normal rank
Property / zbMATH Keywords
 
online algorithms
Property / zbMATH Keywords: online algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
scheduling
Property / zbMATH Keywords: scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
preemption
Property / zbMATH Keywords: preemption / rank
 
Normal rank
Property / zbMATH Keywords
 
linear program
Property / zbMATH Keywords: linear program / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2114146991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive paging with locality of reference / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for preemptive on-line scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Online Scheduling with Reordering / 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: Optimal and online preemptive scheduling on uniformly related machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive online scheduling: Optimal algorithms for all speeds / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Reordering for Online Minimum Makespan Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal preemptive semi-online scheduling to minimize makespan on two related machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for on-line scheduling on uniformly related 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: Randomized on-line scheduling on two uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Scheduling of Uniform Processor Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / 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 on two identical machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Level Algorithm for Preemptive Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi on-line algorithms for the partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling with decreasing job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-on-line problems on two identical machines with combined partial information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling problems on two identical machines with inexact partial information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive on-line scheduling for two uniform processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on on-line scheduling with partial information / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00224-010-9287-2 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:50, 9 December 2024

scientific article
Language Label Description Also known as
English
Semi-online preemptive scheduling: one algorithm for all variants
scientific article

    Statements

    Semi-online preemptive scheduling: one algorithm for all variants (English)
    0 references
    0 references
    0 references
    23 May 2011
    0 references
    online algorithms
    0 references
    scheduling
    0 references
    preemption
    0 references
    linear program
    0 references

    Identifiers