Time-indexed formulation and polynomial time heuristic for a multi-dock truck scheduling problem in a cross-docking centre.
Priscila M. CotaBárbara M. R. GimenezDhiego P. M. AraújoThiago Henrique NogueiraMaurício C. de SouzaMartín Gómez RavettiPublished in: Comput. Ind. Eng. (2016)
Keyphrases
- scheduling problem
- tabu search
- randomly generated test problems
- list scheduling
- heuristic solution
- job shop scheduling problem
- unrelated parallel machines
- single machine
- flowshop
- setup times
- np hard
- quay crane
- metaheuristic
- worst case
- simulated annealing
- feasible solution
- processing times
- strongly np hard
- search algorithm
- mixed integer program
- lagrangian relaxation
- search procedure
- special case
- precedence constraints
- solution quality
- dynamic programming
- mixed integer linear
- parallel machines
- genetic algorithm
- release dates
- vehicle routing problem
- sequence dependent setup times
- upper bound
- polynomially solvable
- min sum
- satisfy the triangle inequality
- computational complexity
- optimal solution