A MIP-based heuristic for a single trade routing and scheduling problem in roll-on roll-off shipping.
Jone R. HansenKjetil FagerholtFrank MeiselPublished in: Comput. Oper. Res. (2022)
Keyphrases
- scheduling problem
- tabu search
- mixed integer programming
- high speed
- np hard
- simulated annealing
- feasible solution
- flowshop
- setup times
- job shop scheduling problem
- single machine
- dynamic programming
- routing algorithm
- routing problem
- strongly np hard
- genetic algorithm
- mathematical programming
- heuristic search
- precedence constraints
- mixed integer program
- unrelated parallel machines