Stochastic Online Scheduling Revisited
From MaRDI portal
Publication:5505682
DOI10.1007/978-3-540-85097-7_42zbMATH Open1168.90489OpenAlexW1589738314MaRDI QIDQ5505682FDOQ5505682
Authors: Andreas S. Schulz 
Publication date: 27 January 2009
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85097-7_42
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Approximation in stochastic scheduling
- Stochastic scheduling problems I — General strategies
- Models and Algorithms for Stochastic Online Scheduling
- The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates
- Single machine scheduling with release dates
- Scheduling Unrelated Machines by Randomized Rounding
- Title not available (Why is that?)
- Scheduling with Random Service Times
- On-line scheduling to minimize average completion time revisited.
- Title not available (Why is that?)
- On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions
- Approximation in Preemptive Stochastic Online Scheduling
- Approximation techniques for average completion time scheduling
- Stochastic Machine Scheduling with Precedence Constraints
- LP-Based Online Scheduling: From Single to Parallel Machines
- The power of \(\alpha\)-points in preemptive single machine scheduling.
- Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions
- Approximation results in parallel machines stochastic scheduling
- On the optimality of static priority policies in stochastic scheduling on parallel machines
- Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds
Cited In (28)
- Approximation in Preemptive Stochastic Online Scheduling
- Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines
- On robust online scheduling algorithms
- Approximation in stochastic scheduling
- Approximation and Online Algorithms
- Online interval scheduling: Randomized and multiprocessor cases
- A tight 2-approximation for preemptive stochastic scheduling
- Greed works -- online algorithms for unrelated machine stochastic scheduling
- Online scheduling on multiple resources under stochastic conditions
- Dynamic resource allocation to improve emergency department efficiency in real time
- Coping with Incomplete Information in Scheduling — Stochastic and Online Models
- Online Scheduling via Learned Weights
- Models and Algorithms for Stochastic Online Scheduling
- Stochastic online scheduling on unrelated machines
- Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines
- Comparing deterministic, robust and online scheduling using entropy
- Generalizing the Kawaguchi-Kyan bound to stochastic parallel machine scheduling
- Online stochastic reservation systems
- Online scheduling for outpatient services with heterogeneous patients and physicians
- LP-based online scheduling: From single to parallel machines
- Dual representation and its online scheduling method for event-varying DESs with capacity constraints
- On index policies for stochastic minsum scheduling
- Unrelated machine scheduling with stochastic processing times
- An improved greedy algorithm for stochastic online scheduling on unrelated machines
- Randomized selection algorithm for online stochastic unrelated machines scheduling
- Opportunistic Scheduling as Restless Bandits
- Approximation Algorithms for 2-Stage Stochastic Scheduling Problems
- OL-DEC-MDP model for multiagent online scheduling with a time-dependent probability of success
This page was built for publication: Stochastic Online Scheduling Revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505682)
