A note on minimizing the sum of squares of machine completion times on two identical parallel machines (Q2358184): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5501827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight upper bound for the \(k\)-partition problem on ideal sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning under the \(L_p\) norm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved delayed-start LPT algorithm for a partition problem on two identical parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiprocessor scheduling: Combining LPT and MULTIFIT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter bounds on a heuristic for a partition problem / rank
 
Normal rank

Latest revision as of 00:51, 14 July 2024

scientific article
Language Label Description Also known as
English
A note on minimizing the sum of squares of machine completion times on two identical parallel machines
scientific article

    Statements

    A note on minimizing the sum of squares of machine completion times on two identical parallel machines (English)
    0 references
    0 references
    21 June 2017
    0 references
    scheduling
    0 references
    identical parallel machines
    0 references
    sum of squares of machine completion times
    0 references
    makespan
    0 references
    approximation algorithms
    0 references

    Identifiers