Branch-and-bound and PSO algorithms for no-wait job shop scheduling.
Abdelhakim AitZaiBrahim BenmedjdoubMourad BoudharPublished in: J. Intell. Manuf. (2016)
Keyphrases
- branch and bound
- job shop scheduling
- combinatorial optimization
- lower bound
- job shop scheduling problem
- branch and bound algorithm
- combinatorial optimization problems
- search algorithm
- optimal solution
- upper bound
- scheduling problem
- column generation
- search space
- branch and bound procedure
- beam search
- randomly generated problems
- tree search
- tree search algorithm
- branch and bound search
- search strategies
- network design problem
- lagrangian heuristic
- resource constraints
- branch and bound method
- simulated annealing
- metaheuristic
- objective function
- bnb adopt
- search strategy