A genetic algorithm and a simulated annealing algorithm combined with column generation technique for solving the problem of scheduling in the hybrid flowshop with additional resources.
Ewa FigielskaPublished in: Comput. Ind. Eng. (2009)
Keyphrases
- simulated annealing algorithm
- column generation
- scheduling problem
- flowshop
- genetic algorithm
- integer program
- simulated annealing
- set partitioning
- branch and bound
- preventive maintenance
- search algorithm
- tabu search
- np hard
- integer programming
- vehicle routing
- sequence dependent setup times
- combinatorial optimization
- linear programming
- linear program
- single machine
- parallel machines
- processing times
- resource allocation
- job shop scheduling problem
- strongly np hard
- constraint programming
- integer linear programming
- cutting plane
- precedence constraints
- lagrangian relaxation
- metaheuristic
- resource consumption
- mutation operator
- optimal solution
- mixed integer programming
- evolutionary algorithm
- harmony search
- special case
- lower bound
- fitness function
- benchmark problems
- minimum cost
- search space
- hybrid algorithm
- branch and bound algorithm
- traveling salesman problem
- genetic algorithm ga
- neural network
- solution quality
- identical parallel machines