Makespan Minimization in Preemptive Two Machine Job Shops.
Sergey V. SevastianovGerhard J. WoegingerPublished in: Computing (1998)
Keyphrases
- makespan minimization
- flowshop
- scheduling problem
- processing times
- job processing times
- single machine
- setup times
- sequence dependent setup times
- total weighted tardiness
- parallel machines
- np hard
- tabu search
- release dates
- special case
- completion times
- job shop scheduling
- polynomially solvable
- single machine scheduling problem
- precedence constraints
- job shop scheduling problem
- steady state
- evolutionary algorithm
- metaheuristic