Scheduling precedence-constrained jobs with stochastic processing times on parallel machines.
Martin SkutellaMarc UetzPublished in: SODA (2001)
Keyphrases
- parallel machines
- processing times
- scheduling problem
- identical parallel machines
- scheduling jobs
- unrelated parallel machines
- flowshop
- single machine
- release dates
- earliness tardiness
- makespan minimization
- setup times
- total tardiness
- precedence constraints
- minimize total
- sequence dependent setup times
- identical machines
- weighted tardiness
- number of tardy jobs
- np hard
- precedence relations
- maximum lateness
- single machine scheduling problem
- total weighted tardiness
- release times
- worst case performance ratio
- job processing times
- completion times
- resource consumption
- job shop scheduling problem
- scheduling decisions
- tabu search
- single server
- polynomially solvable
- parallel computing
- job shop
- competitive ratio
- particle swarm optimization