Aggregation heuristic for the open-pit block scheduling problem.
Enrique JélvezNelson MoralesPierre Nancel-PenardJuan PeypouquetPatricio ReyesPublished in: Eur. J. Oper. Res. (2016)
Keyphrases
- scheduling problem
- open pit
- tabu search
- list scheduling
- unrelated parallel machines
- single machine
- multi depot
- strongly np hard
- job shop scheduling problem
- randomly generated test problems
- np hard
- setup times
- parallel machine scheduling problem
- search algorithm
- parallel machines
- flowshop
- optimal solution
- quay crane
- feasible solution
- simulated annealing
- processing times
- dynamic programming
- metaheuristic
- total tardiness
- sequence dependent setup times
- precedence constraints
- heuristic methods
- permutation flowshop
- data aggregation
- vehicle routing problem
- maximum lateness
- scheduling decisions
- minimizing makespan
- packing problem
- aggregation operators
- upper bound
- search procedure