Scheduling Unrelated Machines by Randomized Rounding
From MaRDI portal
Recommendations
- Scheduling-LPs bear probabilities. Randomized approximations for min-sum criteria
- A unified approach to scheduling on unrelated parallel machines
- Single machine scheduling with release dates
- scientific article; zbMATH DE number 1894930
- Approximation algorithms for scheduling unrelated parallel machines
Cited in
(41)- Unrelated machine scheduling with stochastic processing times
- Approximating weighted completion time via stronger negative correlation
- Stochastic Online Scheduling Revisited
- An \(R||C_{\max}\) quantum scheduling algorithm
- Unrelated machine scheduling of jobs with uniform Smith ratios
- Static routing in stochastic scheduling: performance guarantees and asymptotic optimality
- Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines
- Power of preemption for minimizing total completion time on uniform parallel machines
- An optimal rounding gives a better approximation for scheduling unrelated machines
- An improved greedy algorithm for stochastic online scheduling on unrelated machines
- Stochastic Scheduling on Unrelated Machines
- Almost sure asymptotic optimality for online routing and machine scheduling problems
- Online parallel-machine scheduling in KRT environment to minimize total weighted completion time
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
- Minimizing total completion time with machine-dependent priority lists
- Scheduling-LPs bear probabilities. Randomized approximations for min-sum criteria
- A tight 2-approximation for preemptive stochastic scheduling
- LP-based online scheduling: From single to parallel machines
- Greed works -- online algorithms for unrelated machine stochastic scheduling
- Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints
- Making random choices invisible to the scheduler
- Serving in the dark should be done non-uniformly
- Total completion time scheduling under scenarios
- On-line scheduling to minimize average completion time revisited.
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
- Matroid coflow scheduling
- Analysis of bounds for a capacitated single-item lot-sizing problem
- Scheduling to minimize total weighted completion time via time-indexed linear programming relaxations
- Parallel-machine scheduling of jobs with mixed job-, machine- and position-dependent processing times
- Scheduling parallel machines with inclusive processing set restrictions and job release times
- Decentralized utilitarian mechanisms for scheduling games
- A new approximation algorithm for unrelated parallel machine scheduling with release dates
- A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs
- Unrelated parallel machine scheduling -- perspectives and progress
- Approximability of average completion time scheduling on unrelated machines
- A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time
- Approximability of Average Completion Time Scheduling on Unrelated Machines
- The benefit of preemption with respect to the \(\ell_p\) norm
- The largest-Z-ratio-first algorithm is 0.8531-approximate for scheduling unreliable jobs on \(m\) parallel machines
- Truthfulness for the sum of weighted completion times
- Single machine scheduling with release dates
This page was built for publication: Scheduling Unrelated Machines by Randomized Rounding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785695)
