Unrelated machine scheduling with stochastic processing times
From MaRDI portal
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Analysis of algorithms (68W40) Stochastic scheduling theory in operations research (90B36) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
Cites work
- A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines
- A new average case analysis for completion time scheduling
- A PTAS for minimizing the total weighted completion time on identical parallel machines.
- A tight 2-approximation for preemptive stochastic scheduling
- Approximating the stochastic Knapsack problem: the benefit of adaptivity
- Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits
- Approximation and randomization in scheduling
- Approximation in stochastic scheduling
- Approximation results in parallel machines stochastic scheduling
- Approximation techniques for average completion time scheduling
- Beyond Competitive Analysis
- Convex quadratic and semidefinite programming relaxations in scheduling
- scientific article; zbMATH DE number 1305540 (Why is no real title available?)
- scientific article; zbMATH DE number 3349081 (Why is no real title available?)
- LP-based online scheduling: From single to parallel machines
- Models and Algorithms for Stochastic Online Scheduling
- Non-approximability results for scheduling problems with minsum criteria
- On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Polynomial time approximation algorithms for machine scheduling: Ten open problems
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Scheduling Unrelated Machines by Randomized Rounding
- Scheduling with Random Service Times
- Stochastic Machine Scheduling with Precedence Constraints
- Stochastic Online Scheduling Revisited
- Stochastic Scheduling on Unrelated Machines
- Stochastic scheduling problems I — General strategies
- Structure of a simple scheduling polyhedron
- The expected competitive ratio for weighted completion time scheduling
- Turnpike Optimality of Smith's Rule in Parallel Machines Stochastic Scheduling
- When greediness fails: examples from stochastic scheduling.
Cited in
(26)- Scheduling in multi-scenario environment with an agreeable condition on job processing times
- Randomized selection algorithm for online stochastic unrelated machines scheduling
- Parameterized multi-scenario single-machine scheduling problems
- Risk-averse single machine scheduling: complexity and approximation
- A new approximation algorithm for unrelated parallel machine scheduling with release dates
- On index policies for stochastic minsum scheduling
- On the completion time and the interruption time of a job processed on an unreliable machine
- Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines
- An improved greedy algorithm for stochastic online scheduling on unrelated machines
- Stability of scheduling with random processing times on one machine
- Stochastic Scheduling on Unrelated Machines
- Generalizing the Kawaguchi-Kyan bound to stochastic parallel machine scheduling
- Performance of the smallest-variance-first rule in appointment sequencing
- Greed works -- online algorithms for unrelated machine stochastic scheduling
- Approximations to stochastic dynamic programs via information relaxation duality
- Static routing in stochastic scheduling: performance guarantees and asymptotic optimality
- A dynamic heuristic for the stochastic unrelated parallel machine scheduling problem
- On the completion time of a job processed on an unreliable machine
- A state-of-the-art survey on multi-scenario scheduling
- Fifty years of research in scheduling -- theory and applications
- Scheduling on a stochastic number of machines
- A distributionally robust approach for the parallel machine scheduling problem with optional machines and job tardiness
- Revisiting the development trajectory of parallel machine scheduling
- A weighted distribution-free model for parallel machine scheduling with uncertain job processing times
- Configuration balancing for stochastic requests
- Repairing schedules by removing waiting times: a parameterized complexity analysis
This page was built for publication: Unrelated machine scheduling with stochastic processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3186530)
