On preemption redundancy in scheduling unit processing time jobs on two parallel machines.
Philippe BaptisteVadim G. TimkovskyPublished in: IPDPS (2001)
Keyphrases
- parallel machines
- unrelated parallel machines
- scheduling problem
- minimize total
- release dates
- sequence dependent setup times
- earliness tardiness
- precedence constraints
- total tardiness
- scheduling jobs
- weighted tardiness
- identical parallel machines
- maximum lateness
- makespan minimization
- setup times
- parallel computing
- open shop
- total weighted tardiness
- flowshop
- single server
- list scheduling
- parallel machine scheduling problem
- shared memory
- single machine
- pairwise
- processing times
- special case