Succinct Representation of Linear Extensions via MDDs and Its Application to Scheduling Under Precedence Constraints.
Fumito MiyakeEiji TakimotoKohei HatanoPublished in: IWOCA (2019)
Keyphrases
- efficient computation
- decision diagrams
- precedence constraints
- scheduling problem
- branch and bound algorithm
- precedence relations
- series parallel
- parallel machines
- release dates
- maximum lateness
- approximation algorithms
- parallel processors
- single machine scheduling problem
- sequence dependent setup times
- partial order
- unit length
- knowledge compilation
- global constraints
- single machine
- processing times
- flowshop
- np hard
- markov decision processes
- tabu search
- upper bound
- data structure