Approximation Algorithms for Multitasking Scheduling Problems.
Feifeng ZhengZhaojie WangMing LiuChengbin ChuPublished in: IEEE Access (2020)
Keyphrases
- approximation algorithms
- scheduling problem
- np hard
- single machine
- precedence constraints
- special case
- flowshop
- minimum cost
- processing times
- vertex cover
- worst case
- np hardness
- np complete
- optimal solution
- setup times
- integer programming
- tabu search
- facility location problem
- open shop
- lower bound
- primal dual
- branch and bound algorithm
- job shop
- linear programming
- network design problem
- job shop scheduling
- greedy heuristic
- job shop scheduling problem
- set cover
- approximation schemes
- approximation ratio
- disjoint paths
- sequence dependent setup times
- constraint satisfaction problems
- computational complexity
- parallel machines
- linear program
- randomized algorithms
- strongly np hard
- knapsack problem
- genetic algorithm