Bicriteria approximation algorithms for scheduling problems with communications delays.
Evripidis BampisAlexander V. KononovPublished in: J. Sched. (2005)
Keyphrases
- approximation algorithms
- bicriteria
- flowshop
- scheduling problem
- np hard
- special case
- knapsack problem
- single machine
- processing times
- setup times
- vertex cover
- minimum cost
- efficient solutions
- minimizing makespan
- precedence constraints
- completion times
- worst case
- tabu search
- lower bound
- integer linear programming
- job shop scheduling
- np complete
- linear programming
- set cover
- integer programming
- optimal solution
- computational complexity
- job shop
- primal dual
- parallel machines
- branch and bound algorithm
- shortest path problem
- constant factor
- constant factor approximation
- job shop scheduling problem
- combinatorial optimization problems
- approximation ratio
- constraint satisfaction problems
- vehicle routing problem
- metaheuristic
- shortest path
- random walk
- dynamic programming