Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time (Q837179): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2009.05.023 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57185761 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2009.05.023 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2009679762 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Techniques for Average Completion Time Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: LP-Based Online Scheduling: From Single to Parallel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling to minimize average completion time revisited. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling of parallel machines to minimize total completion times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling of two uniform machines to minimize total completion times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the total completion time on-line on a single machine, using restarts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of on-line scheduling algorithms to minimize total completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line preemptive scheduling on uniform machines / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2009.05.023 / rank
 
Normal rank

Latest revision as of 04:45, 10 December 2024

scientific article
Language Label Description Also known as
English
Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time
scientific article

    Statements

    Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 September 2009
    0 references
    online scheduling
    0 references
    uniform machines
    0 references
    total completion time
    0 references
    weight
    0 references
    competitive analysis
    0 references

    Identifiers