Approximation algorithms for coupled task scheduling minimizing the sum of completion times.
David FischerPéter GyörgyiPublished in: Ann. Oper. Res. (2023)
Keyphrases
- approximation algorithms
- sum of completion times
- scheduling problem
- np hard
- lower bound
- worst case
- completion times
- single machine
- special case
- minimum cost
- upper bound
- vertex cover
- flowshop
- precedence constraints
- constant factor
- scheduling algorithm
- open shop
- randomized algorithms
- linear programming
- approximation ratio
- optimal solution
- branch and bound algorithm
- tabu search
- primal dual
- computational complexity
- processing times
- lagrangian relaxation
- set cover
- disjoint paths
- parallel machines
- integer programming
- constraint satisfaction problems
- network flow
- polynomial time approximation
- ant colony optimization