Unrelated Machine Scheduling with Stochastic Processing Times (Q3186530): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Approximation Techniques for Average Completion Time Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: LP-based online scheduling: From single to parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624436 / 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: Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Approximability Results for Scheduling Problems with Minsum Criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond Competitive Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight 2-Approximation for Preemptive Stochastic Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and Algorithms for Stochastic Online Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic scheduling problems I — General strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation in stochastic scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure of a simple scheduling polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Random Service Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new average case analysis for completion time scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Online Scheduling Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Unrelated Machines by Randomized Rounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation algorithms for machine scheduling: Ten open problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex quadratic and semidefinite programming relaxations in scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Machine Scheduling with Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Scheduling on Unrelated Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expected competitive ratio for weighted completion time scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: When greediness fails: examples from stochastic scheduling. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation results in parallel machines stochastic scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turnpike Optimality of Smith's Rule in Parallel Machines Stochastic Scheduling / rank
 
Normal rank

Latest revision as of 10:04, 12 July 2024

scientific article
Language Label Description Also known as
English
Unrelated Machine Scheduling with Stochastic Processing Times
scientific article

    Statements

    Unrelated Machine Scheduling with Stochastic Processing Times (English)
    0 references
    0 references
    0 references
    0 references
    10 August 2016
    0 references
    stochastic scheduling
    0 references
    approximation algorithm
    0 references
    linear programming relaxation
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references