Mathematical modeling and two efficient branch and bound algorithms for job shop scheduling problem followed by an assembly stage.
Fatemeh DaneshamoozParviz FattahiSeyed Mohammad Hassan HosseiniPublished in: Kybernetes (2021)
Keyphrases
- job shop scheduling problem
- branch and bound algorithm
- mathematical modeling
- job shop scheduling
- lower bound
- combinatorial optimization
- tabu search
- branch and bound
- scheduling problem
- combinatorial optimization problems
- test problems
- simulated annealing
- upper bound
- np hard
- benchmark problems
- graph model
- genetic algorithm
- machine learning
- optimization problems
- neural network
- optimal solution
- artificial intelligence