On polynomial-time approximation algorithms for the variable length scheduling problem.
Artur CzumajLeszek GasieniecDaya Ram GaurRamesh KrishnamurtiWojciech RytterMichele ZitoPublished in: Theor. Comput. Sci. (2003)
Keyphrases
- approximation algorithms
- variable length
- scheduling problem
- np hard
- fixed length
- special case
- approximation ratio
- precedence constraints
- single machine
- worst case
- np hardness
- strongly np hard
- flowshop
- n gram
- lower bound
- set cover
- setup times
- polynomially solvable
- linear programming
- vertex cover
- minimum cost
- optimal solution
- processing times
- integer programming
- open shop
- randomized algorithms
- tabu search
- bitstream
- primal dual
- computational complexity
- branch and bound algorithm
- approximation guarantees
- polynomial time approximation
- video sequences
- sequence dependent setup times
- parallel machines
- greedy algorithm
- information extraction
- constant factor approximation