Locating Service Centers with Precedence Constraints.
Y. KaufmanArie TamirPublished in: Discret. Appl. Math. (1993)
Keyphrases
- precedence constraints
- scheduling problem
- branch and bound algorithm
- precedence relations
- vertex cover
- single machine scheduling problem
- sequence dependent setup times
- approximation algorithms
- unit length
- partial order
- series parallel
- global constraints
- release dates
- web services
- partially ordered
- maximum lateness
- parallel processors
- parallel machines
- setup times
- partially ordered sets
- single machine
- lower bound
- tabu search
- multi dimensional
- single server
- flowshop