Approximation results for flow shop scheduling problems with machine availability constraints.
Mikhail A. KubzinChris N. PottsVitaly A. StrusevichPublished in: Comput. Oper. Res. (2009)
Keyphrases
- flowshop
- scheduling problem
- processing times
- flowshop scheduling
- precedence constraints
- sequence dependent setup times
- setup times
- single machine
- bicriteria
- special case
- minimizing total tardiness
- tabu search
- minimizing makespan
- total tardiness
- makespan minimization
- asymptotic optimality
- maximum lateness
- np hard
- unrelated parallel machines
- job shop scheduling
- parallel machines
- total weighted tardiness
- approximation algorithms
- job shop
- open shop
- job shop scheduling problem
- flowshop scheduling problems
- permutation flowshop
- strongly np hard
- lot streaming
- scheduling jobs
- global constraints
- release dates
- error bounds
- preventive maintenance