Scheduling of uniform parallel machines with s-precedence constraints.
Eun-Seok KimPublished in: Math. Comput. Model. (2011)
Keyphrases
- precedence constraints
- scheduling problem
- branch and bound algorithm
- precedence relations
- parallel machines
- release dates
- parallel processors
- maximum lateness
- single machine scheduling problem
- vertex cover
- global constraints
- sequence dependent setup times
- partial order
- approximation algorithms
- series parallel
- setup times
- unit length
- partially ordered
- single machine
- identical machines
- processing times
- lower bound
- upper bound
- np hard
- flowshop
- branch and bound
- parallel computing
- partially ordered sets
- temporal constraints
- heuristic search
- tabu search
- special case