Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms.
Kameng NipZhenbo WangWenxun XingPublished in: CoRR (2013)
Keyphrases
- approximation algorithms
- shortest path problem
- np hard
- scheduling problem
- worst case
- np hardness
- shortest path
- precedence constraints
- special case
- single source
- minimum cost
- computational complexity
- combinatorial optimization problems
- primal dual
- interval data
- randomized algorithms
- vertex cover
- directed graph
- flowshop
- approximation ratio
- constant factor
- set cover
- branch and bound algorithm
- processing times
- job shop scheduling
- open shop
- job shop scheduling problem
- single machine
- linear programming
- lower bound
- directed acyclic graph
- setup times
- tabu search
- job shop
- strongly np hard
- upper bound
- multiple objectives
- branch and bound
- random variables
- constraint satisfaction problems