Computing lower and upper bounds for a large-scale industrial job shop scheduling problem.
Márton DrótosGábor ErdösTamás KisPublished in: Eur. J. Oper. Res. (2009)
Keyphrases
- lower and upper bounds
- job shop scheduling problem
- job shop scheduling
- lower bound
- upper bound
- critical path
- scheduling problem
- upper and lower bounds
- benchmark problems
- tabu search
- production scheduling
- genetic algorithm
- simulated annealing
- memetic algorithm
- combinatorial optimization problems
- graph model
- lagrangian relaxation
- combinatorial optimization
- artificial neural networks
- branch and bound algorithm
- lagrangian dual
- search strategies
- branch and bound
- traveling salesman problem
- metaheuristic
- search algorithm