A Branch and Bound Algorithm for the Job-Shop Scheduling Problem.
Peter BruckerBernd JurischBernd SieversPublished in: Discret. Appl. Math. (1994)
Keyphrases
- branch and bound algorithm
- job shop scheduling problem
- combinatorial optimization
- job shop scheduling
- combinatorial optimization problems
- branch and bound
- lower bound
- scheduling problem
- critical path
- np hard
- simulated annealing
- upper bound
- memetic algorithm
- tabu search
- genetic algorithm
- benchmark problems
- optimal solution
- graph model
- test problems
- precedence constraints
- single machine scheduling problem
- traveling salesman problem
- finding an optimal solution
- metaheuristic
- max sat
- special case
- upper bounding
- lagrangian relaxation
- optimization problems
- search algorithm
- processing times
- crossover operator
- feasible solution
- shortest path
- exact algorithms
- linear programming
- language model