A branch and bound algorithm for scheduling trains in a railway network.
Andrea D'ArianoDario PacciarelliMarco PranzoPublished in: Eur. J. Oper. Res. (2007)
Keyphrases
- branch and bound algorithm
- precedence constraints
- lower bound
- upper bound
- branch and bound
- lower bounding
- scheduling problem
- combinatorial optimization
- randomly generated problems
- single machine scheduling problem
- np hard
- optimal solution
- variable ordering
- mixed integer linear programming
- upper bounding
- network structure
- branch and bound method
- dominance rules
- resource consumption
- single machine
- complex networks
- parallel machines
- approximation algorithms
- sequence dependent setup times
- scheduling algorithm
- maximum clique
- response time
- objective function