Approximation algorithms for the parallel flow shop problem.
Xiandong ZhangSteef L. van de VeldePublished in: Eur. J. Oper. Res. (2012)
Keyphrases
- approximation algorithms
- open shop
- flowshop
- special case
- scheduling problem
- np hard
- strongly np hard
- precedence constraints
- vertex cover
- parallel machines
- sequence dependent setup times
- worst case
- processing times
- setup times
- minimum cost
- job shop
- flowshop scheduling
- flowshop scheduling problems
- shared memory
- lot streaming
- combinatorial auctions
- approximation ratio
- single machine
- tabu search
- maximum lateness
- lower bound
- optimal solution
- job shop scheduling
- linear program
- polynomial time approximation
- np complete
- linear programming
- evolutionary algorithm
- closest string