Minimizing maximum (weighted) flow-time on related and unrelated machines (Q513278): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-015-0082-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2190420042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling to minimize Max flow time: an optimal preemptive algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Meeting Deadlines: How Much Speed Suffices? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Competitiveness of On-Line Assignments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-Line Load Balancing of Temporary Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Server scheduling in the L <sub>p</sub> norm / rank
 
Normal rank
Property / cites work
 
Property / cites work: LATIN 2004: Theoretical Informatics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633926 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal time-critical scheduling via resource augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-Norms and All-L_p-Norms Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252341 / rank
 
Normal rank

Latest revision as of 12:06, 13 July 2024

scientific article
Language Label Description Also known as
English
Minimizing maximum (weighted) flow-time on related and unrelated machines
scientific article

    Statements

    Minimizing maximum (weighted) flow-time on related and unrelated machines (English)
    0 references
    0 references
    0 references
    0 references
    3 March 2017
    0 references
    scheduling
    0 references
    minimizing flow-time
    0 references
    online algorithms
    0 references
    competitive analysis
    0 references

    Identifiers