A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption (Q2896382): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(2 intermediate revisions by 2 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.1007/978-3-642-29116-6_9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W92055354 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:37, 19 March 2024

scientific article
Language Label Description Also known as
English
A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption
scientific article

    Statements

    A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption (English)
    0 references
    0 references
    0 references
    16 July 2012
    0 references

    Identifiers