Pruning search spaces by dominance rules: a case study in the job shop scheduling.
María R. SierraRamiro VarelaPublished in: Int. J. Reason. based Intell. Syst. (2010)
Keyphrases
- job shop scheduling
- search space
- scheduling problem
- dominance rules
- job shop scheduling problem
- single machine
- maximum lateness
- metaheuristic
- combinatorial optimization problems
- search algorithm
- search strategy
- flowshop
- setup times
- tabu search
- np hard
- optimal solution
- branch and bound
- processing times
- fitness function
- computational intelligence
- lower bound
- search procedure
- graph model
- neural network
- genetic algorithm