On preemption redundancy in scheduling unit processing time jobs on two parallel machines.
Philippe BaptisteVadim G. TimkovskyPublished in: Oper. Res. Lett. (2001)
Keyphrases
- parallel machines
- unrelated parallel machines
- scheduling problem
- total tardiness
- earliness tardiness
- minimize total
- sequence dependent setup times
- precedence constraints
- release dates
- scheduling jobs
- weighted tardiness
- identical parallel machines
- setup times
- total weighted tardiness
- makespan minimization
- maximum lateness
- flowshop
- parallel machine scheduling problem
- list scheduling
- shared memory
- open shop
- single machine
- single server
- parallel computing
- lot sizing
- identical machines
- random variables
- np hard
- information systems