Flowshop and Jobshop Schedules: Complexity and Approximation.
Teofilo F. GonzalezSartaj SahniPublished in: Oper. Res. (1978)
Keyphrases
- scheduling problem
- flowshop
- single machine
- processing times
- minimizing makespan
- flowshop scheduling
- bicriteria
- minimizing total tardiness
- np hard
- total tardiness
- maximum lateness
- flowshop scheduling problems
- precedence constraints
- tabu search
- setup times
- sequence dependent setup times
- permutation flowshop
- robotic cell
- special case
- release dates
- worst case
- strongly np hard
- total weighted tardiness
- approximation ratio
- job shop scheduling problem
- parallel machines
- optimal solution