Pruning by dominance in best-first search for the job shop Scheduling problem with total flow time.
María R. SierraRamiro VarelaPublished in: J. Intell. Manuf. (2010)
Keyphrases
- job shop scheduling problem
- job shop scheduling
- critical path
- tabu search
- production scheduling
- genetic algorithm
- benchmark problems
- memetic algorithm
- scheduling problem
- simulated annealing
- search space
- job shop
- combinatorial optimization problems
- search algorithm
- benchmark instances
- heuristic search
- branch and bound
- makespan minimization
- graph model
- combinatorial optimization
- search strategy
- tabu search algorithm
- neural network
- random walk
- multi objective
- lower bound