On a parallel machine scheduling problem with precedence constraints.
Isto AhoErkki MäkinenPublished in: J. Sched. (2006)
Keyphrases
- precedence constraints
- parallel machine scheduling problem
- scheduling problem
- release dates
- sequence dependent setup times
- parallel machines
- maximum lateness
- branch and bound algorithm
- total weighted tardiness
- single machine scheduling problem
- single machine
- approximation algorithms
- setup times
- flowshop
- np hard
- processing times
- partial order
- branch and bound
- partially ordered
- global constraints
- tabu search
- genetic algorithm
- lower bound
- asymptotically optimal
- lagrangian relaxation
- job shop scheduling problem
- lot sizing
- job shop
- search space
- optimal solution