Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints.
Irene N. LushchakovaPublished in: Eur. J. Oper. Res. (2006)
Keyphrases
- scheduling problem
- release dates
- processing times
- precedence constraints
- flowshop
- sequence dependent setup times
- single machine
- parallel machines
- scheduling jobs
- maximum lateness
- single machine scheduling problem
- setup times
- identical machines
- job processing times
- precedence relations
- makespan minimization
- total weighted tardiness
- earliness tardiness
- tabu search
- strongly np hard
- completion times
- release times
- np hard
- job shop scheduling problem
- polynomially solvable
- identical parallel machines
- competitive ratio
- special case
- response time
- simulated annealing
- resource consumption
- computational complexity