An analysis of the LPT algorithm for the max-min and the min-ratio partition problems (Q817816): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Asymptotic Optimality of the LPT Rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter bounds on a heuristic for a partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Scheduling Independent Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Analysis of an Algorithm for Balanced Parallel Processor Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The modified differencing method for the set partitioning problem with cardinality constraints / rank
 
Normal rank

Latest revision as of 12:07, 24 June 2024

scientific article
Language Label Description Also known as
English
An analysis of the LPT algorithm for the max-min and the min-ratio partition problems
scientific article

    Statements

    Identifiers