On-line scheduling of unit time jobs with rejection: Minimizing the total completion time (Q1870022): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Gerhard J. Woeginger / rank
Normal rank
 
Property / author
 
Property / author: Gerhard J. Woeginger / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiprocessor Scheduling with Rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Techniques for scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive multiprocessor scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms. The state of the art / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0167-6377(02)00160-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2013892022 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:27, 30 July 2024

scientific article
Language Label Description Also known as
English
On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
scientific article

    Statements

    On-line scheduling of unit time jobs with rejection: Minimizing the total completion time (English)
    0 references
    0 references
    0 references
    0 references
    4 May 2003
    0 references
    scheduling
    0 references
    on-line algorithm
    0 references
    competitive analysis
    0 references
    worst-case bounds
    0 references

    Identifiers