Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem.
Leo G. KroonMarc SalomonLuk N. Van WassenhovePublished in: Oper. Res. (1997)
Keyphrases
- approximation algorithms
- scheduling problem
- np hard
- precedence constraints
- special case
- single machine
- strongly np hard
- flowshop
- vertex cover
- minimum cost
- lower bound
- facility location problem
- tabu search
- optimal solution
- np hardness
- setup times
- approximation ratio
- linear programming
- worst case
- set cover
- processing times
- integer programming
- constant factor
- branch and bound algorithm
- network design problem
- job shop scheduling
- approximation schemes
- job shop
- open shop
- primal dual
- parallel machines
- knapsack problem
- randomized algorithms
- branch and bound
- constraint satisfaction problems
- optimization problems
- exact algorithms
- release dates
- job shop scheduling problem
- polynomial time approximation
- linear program