Scheduling tasks with exponential service times on parallel processors
From MaRDI portal
Publication:3207873
Cited in
(18)- A state-of-the-art survey on multi-scenario scheduling
- Scheduling jobs on heterogeneous processors
- Analysis of computer job control under uncertainty
- Stochastic scheduling on parallel machines to minimize discounted holding costs
- Optimal control of a multiclass queueing system when customers can change types
- Common due-date assignment and scheduling on single machine with exponential processing times.
- Scheduling stochastic jobs with increasing hazard rate on identical parallel machines
- A tight 2-approximation for preemptive stochastic scheduling
- Approximation results in parallel machines stochastic scheduling
- Scheduling independent jobs with stochastic processing times and a common due date on parallel and identical machines
- Single-machine scheduling with general costs under compound-type distributions
- Loading and Sequencing on Parallel Machines
- Scheduling in multi-scenario environment with an agreeable condition on job processing times
- Minimizing expected makespans of multi-priority classes of jobs on uniform processors
- Parameterized multi-scenario single-machine scheduling problems
- Robust scheduling of parallel machines with sequence-dependent set-up costs
- On index policies for stochastic minsum scheduling
- General stochastic single-machine scheduling with regular cost functions
This page was built for publication: Scheduling tasks with exponential service times on parallel processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3207873)
