scientific article
From MaRDI portal
Publication:3304142
DOI10.4230/LIPIcs.STACS.2018.43zbMath1487.90335arXiv1801.01105MaRDI QIDQ3304142
Publication date: 5 August 2020
Full work available at URL: https://arxiv.org/abs/1801.01105
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
parallel machinesapproximation algorithmstochastic schedulingList schedulingweighted shortest (expected) processing time rule
Related Items (3)
Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines ⋮ Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling ⋮ On index policies for stochastic minsum scheduling
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An alternative proof of the Kawaguchi-Kyan bound for the largest-ratio-first rule
- Approximation results in parallel machines stochastic scheduling
- A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
- Stochastic online scheduling on unrelated machines
- Analysis of Smith's rule in stochastic machine scheduling
- Approximation Techniques for Average Completion Time Scheduling
- A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines
- Single Machine Scheduling with Release Dates
- Approximation in stochastic scheduling
- Unrelated Machine Scheduling with Stochastic Processing Times
- Stochastic scheduling problems I — General strategies
- Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
- Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime
- Turnpike Optimality of Smith's Rule in Parallel Machines Stochastic Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Unrelated Machine Scheduling of Jobs with Uniform Smith Ratios
- Models and Algorithms for Stochastic Online Scheduling
- Stochastic Online Scheduling Revisited
- Scheduling with Random Service Times
- Ancient and new algorithms for load balancing in the \(\ell_p\) norm
This page was built for publication:
