Approximation algorithms for the twin robot scheduling problem.
Florian JaehnAndreas WiehlPublished in: J. Sched. (2020)
Keyphrases
- approximation algorithms
- scheduling problem
- np hard
- mobile robot
- precedence constraints
- special case
- strongly np hard
- single machine
- minimum cost
- flowshop
- worst case
- vertex cover
- setup times
- approximation ratio
- lower bound
- optimal solution
- network design problem
- primal dual
- facility location problem
- job shop scheduling
- linear programming
- constant factor
- np hardness
- parallel machines
- open shop
- processing times
- approximation schemes
- tabu search
- undirected graph
- combinatorial auctions
- integer programming
- job shop
- branch and bound algorithm
- sequence dependent setup times
- disjoint paths
- set cover
- greedy heuristic
- job shop scheduling problem
- linear program
- computational complexity
- randomized algorithms
- knapsack problem
- error bounds