Cable tree wiring - benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints.
Jana KoehlerJosef BürglerUrs FontanaEtienne FuxFlorian A. HerzogMarc PoulySophia SallerAnastasia SalyaevaPeter ScheiblechnerKai WaeltiPublished in: Constraints An Int. J. (2021)
Keyphrases
- precedence constraints
- scheduling problem
- real world
- single machine
- precedence relations
- setup times
- np hard
- release dates
- sequence dependent setup times
- vertex cover
- maximum lateness
- parallel processors
- global constraints
- parallel machines
- single machine scheduling problem
- flowshop
- branch and bound algorithm
- tabu search
- total tardiness
- processing times
- series parallel
- unit length
- partially ordered sets
- approximation algorithms
- job shop scheduling problem
- partial order
- partially ordered
- makespan minimization
- distributed systems