A local branching heuristic for the open pit mine production scheduling problem.
Mehran SamavatiDaryl EssamMicah NehringRuhul A. SarkerPublished in: Eur. J. Oper. Res. (2017)
Keyphrases
- scheduling problem
- open pit
- tabu search
- list scheduling
- job shop scheduling problem
- multi depot
- single machine
- limited capacity
- unrelated parallel machines
- randomly generated test problems
- quay crane
- production scheduling
- flowshop
- strongly np hard
- setup times
- production planning and scheduling
- np hard
- preventive maintenance
- processing times
- minimizing makespan
- variable ordering
- branch and bound
- permutation flowshop
- precedence constraints
- optimal solution
- parallel machines
- simulated annealing
- search tree
- search algorithm
- heuristic methods
- feasible solution
- maximum lateness
- packing problem
- combinatorial optimization
- raw material
- search procedure
- dynamic programming