Approximation Algorithms for Scheduling Arithmetic Expressions on Pipelined Machines.
David BernsteinMichael RodehIzidor GertnerPublished in: J. Algorithms (1989)
Keyphrases
- approximation algorithms
- precedence constraints
- identical machines
- np hard
- polynomial time approximation
- scheduling problem
- parallel machines
- special case
- vertex cover
- parallel processors
- minimum cost
- worst case
- flowshop
- facility location problem
- processing times
- release dates
- wafer fabrication
- network design problem
- open shop
- approximation ratio
- constant factor
- np hardness
- set cover
- primal dual
- sequence dependent setup times
- randomized algorithms
- resource constraints
- undirected graph
- resource allocation
- approximation schemes
- single machine scheduling problem
- combinatorial auctions
- dynamic programming
- constant factor approximation