Scheduling preemptive jobs with precedence constraints on parallel machines.
Khaled DjellabPublished in: Eur. J. Oper. Res. (1999)
Keyphrases
- precedence constraints
- parallel machines
- scheduling problem
- unrelated parallel machines
- release dates
- precedence relations
- sequence dependent setup times
- total tardiness
- flowshop
- single machine
- minimize total
- processing times
- setup times
- weighted tardiness
- maximum lateness
- single machine scheduling problem
- scheduling jobs
- total weighted tardiness
- parallel processors
- identical parallel machines
- makespan minimization
- np hard
- identical machines
- tabu search
- single server
- job shop scheduling problem
- scheduling algorithm
- open shop
- strongly np hard
- job shop
- parallel computing
- lower bound