Scheduling unit-length jobs with precedence constraints of small height.
André BergerAlexander GrigorievPinar HeggernesRuben van der ZwaanPublished in: Oper. Res. Lett. (2014)
Keyphrases
- precedence constraints
- unit length
- scheduling problem
- branch and bound algorithm
- precedence relations
- parallel machines
- release dates
- single machine to minimize
- approximation algorithms
- sequence dependent setup times
- parallel processors
- maximum lateness
- single machine scheduling problem
- setup times
- identical machines
- vertex cover
- partial order
- single machine
- global constraints
- partially ordered
- series parallel
- total tardiness
- processing times
- flowshop
- identical parallel machines
- release times
- upper bound
- tabu search
- lower bound
- dynamic programming
- branch and bound
- partially ordered sets
- genetic algorithm