Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms.
Kameng NipZhenbo WangWenxun XingPublished in: COCOON (2015)
Keyphrases
- approximation algorithms
- shortest path problem
- np hard
- scheduling problem
- worst case
- np hardness
- shortest path
- precedence constraints
- open shop
- job shop
- special case
- vertex cover
- combinatorial optimization problems
- interval data
- job shop scheduling
- computational complexity
- minimum cost
- single source
- strongly np hard
- np complete
- primal dual
- optimal solution
- disjoint paths
- job shop scheduling problem
- single machine
- upper bound
- set cover
- directed graph
- randomized algorithms
- processing times
- knapsack problem
- constant factor
- combinatorial auctions
- approximation ratio
- genetic programming
- linear programming
- search algorithm