Approximation for preemptive scheduling stochastic jobs on identical parallel machines.
Xiaoyong TangKenli LiFan WuPublished in: BIC-TA (2010)
Keyphrases
- preemptive scheduling
- identical parallel machines
- fixed number
- scheduling problem
- processing times
- strongly np hard
- scheduling jobs
- approximation algorithms
- release dates
- single server
- parallel machines
- competitive ratio
- single machine
- queueing networks
- average case
- flowshop
- lower bound
- special case
- learning algorithm
- search space