Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines That Run at Fifferent Speeds (Extended Abstract).
Fabián A. ChudakDavid B. ShmoysPublished in: SODA (1997)
Keyphrases
- extended abstract
- approximation algorithms
- parallel machines
- scheduling problem
- np hard
- open shop
- precedence constraints
- total tardiness
- earliness tardiness
- unrelated parallel machines
- single machine
- special case
- flowshop
- sequence dependent setup times
- setup times
- vertex cover
- minimum cost
- job shop scheduling problem
- tabu search
- worst case
- integer programming
- job shop
- lower bound
- optimal solution
- job shop scheduling
- release dates
- set cover
- processing times
- branch and bound algorithm
- computational complexity
- approximation ratio
- single server
- constant factor
- linear programming
- strongly np hard
- parallel computing
- knapsack problem
- constraint satisfaction problems