Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times (Q2398640): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Scheduling independent tasks to reduce mean finishing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal and online preemptive scheduling on uniformly related machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal preemptive scheduling for general target functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Scheduling of Uniform Processor Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Minimizing Average Flow Time with Parallel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Level Algorithm for Preemptive Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3217922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Deadlines and Loss Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan and preemption costs on a system of uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537758 / rank
 
Normal rank

Latest revision as of 07:31, 14 July 2024

scientific article
Language Label Description Also known as
English
Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times
scientific article

    Statements

    Identifiers