Optimal on-line flow time with resource augmentation (Q2489955): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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.dam.2005.05.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2099303310 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the flow time without migration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling data transfers in a network and the set scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal on-line algorithms for single-machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal time-critical scheduling via resource augmentation / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 12:30, 24 June 2024

scientific article
Language Label Description Also known as
English
Optimal on-line flow time with resource augmentation
scientific article

    Statements

    Optimal on-line flow time with resource augmentation (English)
    0 references
    0 references
    0 references
    28 April 2006
    0 references
    Flow time
    0 references
    On-line algorithms
    0 references
    Scheduling
    0 references
    Resource augmentation
    0 references

    Identifiers