Solving a chemical batch scheduling problem by local search.
Peter BruckerJohann L. HurinkPublished in: Ann. Oper. Res. (2000)
Keyphrases
- scheduling problem
- tabu search
- job shop scheduling problem
- combinatorial optimization
- single machine
- graph coloring problems
- search algorithm
- search heuristics
- search procedure
- np hard
- minimizing makespan
- stochastic local search
- precedence constraints
- search algorithm for solving
- systematic search
- memetic algorithm
- genetic algorithm
- simulated annealing
- strongly np hard
- permutation flowshop
- parallel machines
- setup times
- search space
- optimal solution