Complexity of flow shop scheduling problems with transportation constraints.
Ameur SoukhalAmmar OulamaraPatrick MartineauPublished in: Eur. J. Oper. Res. (2005)
Keyphrases
- scheduling problem
- flowshop
- precedence constraints
- processing times
- single machine
- tabu search
- bicriteria
- sequence dependent setup times
- setup times
- flowshop scheduling
- np hard
- minimizing makespan
- unrelated parallel machines
- job shop scheduling
- parallel machines
- total tardiness
- job shop
- maximum lateness
- permutation flowshop
- special case
- asymptotic optimality
- release dates
- strongly np hard
- total weighted tardiness
- job shop scheduling problem
- makespan minimization
- flowshop scheduling problems
- preventive maintenance
- computational complexity
- greedy algorithm
- open shop
- worst case
- total flowtime