Exact algorithms for single-machine scheduling with time windows and precedence constraints.
Morteza DavariErik DemeulemeesterRoel LeusFabrice Talla NobibonPublished in: J. Sched. (2016)
Keyphrases
- precedence constraints
- exact algorithms
- approximation algorithms
- branch and bound algorithm
- precedence relations
- vehicle routing problem
- vertex cover
- np hard
- scheduling problem
- knapsack problem
- single machine scheduling problem
- special case
- max sat
- combinatorial optimization
- sequence dependent setup times
- release dates
- worst case
- combinatorial problems
- traveling salesman problem
- exact solution
- maximum lateness
- combinatorial optimization problems
- upper bound
- optimal solution
- lower bound
- parallel machines
- partially ordered
- global constraints
- partial order
- branch and bound
- particle swarm optimization