Euler is standing in line dial-a-ride problems with precedence-constraints.
Dietrich HauptmeierSven Oliver KrumkeJörg RambauHans-Christoph WirthPublished in: Discret. Appl. Math. (2001)
Keyphrases
- precedence constraints
- scheduling problem
- unit length
- branch and bound algorithm
- precedence relations
- approximation algorithms
- vertex cover
- parallel machines
- partially ordered
- release dates
- single machine scheduling problem
- sequence dependent setup times
- series parallel
- parallel processors
- maximum lateness
- partial order
- global constraints
- optimal solution
- setup times
- differential equations
- upper bound
- partially ordered sets
- single machine
- supply chain
- state space
- total tardiness
- probabilistic model
- neural network