A heuristic to solve the synchronized log-truck scheduling problem.
Nizar El HachemiMichel GendreauLouis-Martin RousseauPublished in: Comput. Oper. Res. (2013)
Keyphrases
- scheduling problem
- randomly generated test problems
- strongly np hard
- tabu search
- graph coloring problems
- job shop scheduling problem
- search algorithm
- single machine
- minimizing makespan
- np hard
- optimal solution
- finding an optimal solution
- flowshop
- multi depot
- vehicle routing problem
- setup times
- unrelated parallel machines
- mixed integer program
- approximation algorithms
- precedence constraints
- search strategies
- processing times
- special case
- permutation flowshop
- solution quality
- quay crane
- lower bound
- dynamic programming
- mathematical programming
- branch and bound algorithm