Non-clairvoyant weighted flow time scheduling on different multi-processor models (Q2344210): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Tak-Wah Lam / rank
Normal rank
 
Property / author
 
Property / author: Tak-Wah Lam / rank
 
Normal rank
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/s00224-013-9475-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2149580315 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q58062872 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter bounds on preemptive job shop scheduling with two machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471337 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-clairvoyant Speed Scaling for Weighted Flow Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling of two-machine open shops where jobs arrive over time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-machine total completion time flow shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling in the dark / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speed is as powerful as clairvoyance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonclairvoyant scheduling / rank
 
Normal rank

Latest revision as of 01:29, 10 July 2024

scientific article
Language Label Description Also known as
English
Non-clairvoyant weighted flow time scheduling on different multi-processor models
scientific article

    Statements

    Non-clairvoyant weighted flow time scheduling on different multi-processor models (English)
    0 references
    0 references
    0 references
    0 references
    12 May 2015
    0 references
    online algorithms
    0 references
    non-clairvoyant scheduling
    0 references
    weighted flow time
    0 references
    multiprocessor scheduling
    0 references
    competitive analysis
    0 references

    Identifiers