Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure.
Janne RoslöfIiro HarjunkoskiTapio WesterlundJohnny IsakssonPublished in: Eur. J. Oper. Res. (2002)
Keyphrases
- scheduling problem
- tabu search
- strongly np hard
- mixed integer program
- search procedure
- linear program
- resource constrained project scheduling problem
- combinatorial optimization
- mip solver
- flowshop
- metaheuristic
- single machine
- np hard
- list scheduling
- feasible solution
- permutation flowshop
- unrelated parallel machines
- job shop scheduling problem
- optimal solution
- dynamic programming
- timetabling problem
- simulated annealing
- finding an optimal solution
- precedence constraints
- variable ordering
- lp relaxation
- search heuristics
- setup times
- variable neighborhood descent
- industrial applications
- search algorithm
- mixed integer linear
- quay crane
- randomly generated test problems
- mixed integer linear programming
- mixed integer
- branch and bound algorithm
- search space
- maximum lateness
- branch and bound
- lower bound