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: CoRR (2020)
Keyphrases
- precedence constraints
- scheduling problem
- real world
- single machine
- precedence relations
- np hard
- setup times
- sequence dependent setup times
- single machine scheduling problem
- flowshop
- release dates
- parallel machines
- parallel processors
- maximum lateness
- global constraints
- vertex cover
- series parallel
- branch and bound algorithm
- tabu search
- processing times
- unit length
- total tardiness
- partially ordered sets
- job shop scheduling problem
- index structure
- partial order
- graph cuts
- special case
- lower bound
- genetic algorithm