Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds.
Fabián A. ChudakDavid B. ShmoysPublished in: J. Algorithms (1999)
Keyphrases
- approximation algorithms
- parallel machines
- scheduling problem
- np hard
- earliness tardiness
- open shop
- special case
- total tardiness
- flowshop
- precedence constraints
- unrelated parallel machines
- single machine
- vertex cover
- sequence dependent setup times
- minimum cost
- worst case
- branch and bound algorithm
- processing times
- optimal solution
- job shop scheduling
- tabu search
- setup times
- release dates
- job shop scheduling problem
- integer programming
- set cover
- lower bound
- constraint satisfaction problems
- job shop
- approximation ratio
- bayesian networks
- knapsack problem
- constant factor
- approximation guarantees
- shared memory
- polynomial time approximation
- single server