Bicriteria approximation algorithms for scheduling problems with communications.
Evripidis BampisAlexander V. KononovPublished in: SPAA (2003)
Keyphrases
- bicriteria
- approximation algorithms
- flowshop
- scheduling problem
- np hard
- special case
- knapsack problem
- processing times
- setup times
- single machine
- efficient solutions
- vertex cover
- worst case
- np complete
- precedence constraints
- optimal solution
- completion times
- job shop scheduling
- minimizing makespan
- lower bound
- minimum cost
- tabu search
- primal dual
- parallel machines
- integer programming
- approximation ratio
- job shop
- computational complexity
- job shop scheduling problem
- branch and bound algorithm
- integer linear programming
- linear programming
- set cover
- constant factor
- constant factor approximation
- polynomial time approximation
- constraint satisfaction problems