A general lower bound for the makespan problem (Q1266724): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3971305 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling independent tasks to reduce mean finishing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099211 / 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: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machines scheduling with nonsimultaneous machine available time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiprocessor scheduling: Combining LPT and MULTIFIT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Scheduling Independent Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Bounds for the Identical Parallel Processor Weighted Flow Time Problem / rank
 
Normal rank

Latest revision as of 15:37, 28 May 2024

scientific article
Language Label Description Also known as
English
A general lower bound for the makespan problem
scientific article

    Statements

    Identifiers