Approximation Algorithms for the Multiorganization Scheduling Problem.
Pierre-François DutotFanny PascualKrzysztof RzadcaDenis TrystramPublished in: IEEE Trans. Parallel Distributed Syst. (2011)
Keyphrases
- approximation algorithms
- scheduling problem
- np hard
- single machine
- special case
- minimum cost
- precedence constraints
- flowshop
- network design problem
- worst case
- strongly np hard
- setup times
- integer programming
- optimal solution
- vertex cover
- np hardness
- processing times
- lower bound
- linear programming
- branch and bound algorithm
- open shop
- tabu search
- set cover
- facility location problem
- undirected graph
- approximation schemes
- release dates
- disjoint paths
- approximation ratio
- knapsack problem
- primal dual
- job shop scheduling problem
- parallel machines
- randomized algorithms
- constant factor approximation
- job shop
- sequence dependent setup times
- computational complexity
- completion times
- job shop scheduling