An improved monotone algorithm for scheduling related machines with precedence constraints (Q408428): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient scheduling of tasks without full use of processor resources / rank
 
Normal rank
Property / cites work
 
Property / cites work: A monotone approximation algorithm for scheduling with precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Parallel Machines On-Line / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints / rank
 
Normal rank

Latest revision as of 02:05, 5 July 2024

scientific article
Language Label Description Also known as
English
An improved monotone algorithm for scheduling related machines with precedence constraints
scientific article

    Statements

    An improved monotone algorithm for scheduling related machines with precedence constraints (English)
    0 references
    0 references
    5 April 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    scheduling
    0 references
    algorithmic mechanism design
    0 references
    precedence constraints
    0 references
    monotone algorithms
    0 references
    0 references