A combined branch-and-bound and genetic algorithm based approach for a flowshop scheduling problem.
Amit NagarSunderesh S. HeraguJorge HaddockPublished in: Ann. Oper. Res. (1996)
Keyphrases
- branch and bound
- scheduling problem
- flowshop
- genetic algorithm
- lower bound
- tabu search
- search algorithm
- job shop scheduling problem
- branch and bound procedure
- branch and bound algorithm
- minimizing makespan
- optimal solution
- np hard
- upper bound
- processing times
- setup times
- combinatorial optimization
- search space
- column generation
- single machine
- total flowtime
- minimizing total tardiness
- total tardiness
- metaheuristic
- bicriteria
- preventive maintenance
- maximum lateness
- flowshop scheduling
- sequence dependent setup times
- makespan minimization
- special case
- permutation flowshop
- tree search
- parallel machines
- ant colony optimization
- precedence constraints
- simulated annealing
- total weighted tardiness
- strongly np hard
- neural network
- linear program
- hybrid algorithm
- optimization problems
- worst case
- single machine scheduling problem
- multi objective
- combinatorial optimization problems
- approximation algorithms