Preemptive online scheduling with rejection of unit jobs on two uniformly related machines.
Leah EpsteinHanan Zebedat-HaiderPublished in: J. Sched. (2014)
Keyphrases
- scheduling problem
- identical machines
- identical parallel machines
- processing times
- flowshop
- parallel machines
- single machine
- scheduling algorithm
- competitive ratio
- online algorithms
- release dates
- job scheduling
- parallel machine scheduling problem
- sequence dependent setup times
- scheduling decisions
- precedence constraints
- unrelated parallel machines
- scheduling strategy
- minimize total
- scheduling jobs
- setup times
- optimal scheduling
- wafer fabrication
- maximum lateness
- fixed number
- release times
- weighted tardiness
- np hard
- precedence relations
- lower bound
- strongly np hard
- preventive maintenance
- job shop
- single machine scheduling problem
- tabu search
- online learning
- real time
- computational grids
- batch processing
- real time database systems
- response time
- special case