The Complexity of Flowshop and Jobshop Scheduling.
Michael R. GareyDavid S. JohnsonRavi SethiPublished in: Math. Oper. Res. (1976)
Keyphrases
- scheduling problem
- flowshop
- preventive maintenance
- maximum lateness
- single machine
- sequence dependent setup times
- processing times
- setup times
- parallel machines
- precedence constraints
- bicriteria
- minimizing makespan
- flowshop scheduling
- np hard
- job shop
- total tardiness
- unrelated parallel machines
- number of tardy jobs
- makespan minimization
- permutation flowshop
- minimizing total tardiness
- tabu search
- flowshop scheduling problems
- release dates
- job shop scheduling problem
- lot streaming
- computational complexity
- maintenance cost
- strongly np hard
- multistage
- response time
- robotic cell
- single machine scheduling problem
- search procedure
- np complete
- special case
- search space