An enhanced greedy random adaptive search procedure with path-relinking for no-wait flowshop problem with setup times.
Xia ZhuXiaoping LiPublished in: Integr. Comput. Aided Eng. (2016)
Keyphrases
- path relinking
- setup times
- search procedure
- flowshop
- tabu search
- scheduling problem
- search algorithm
- hill climbing
- single machine scheduling problem
- sequence dependent setup times
- simulated annealing
- metaheuristic
- processing times
- search space
- feasible solution
- total tardiness
- bicriteria
- heuristic methods
- memetic algorithm
- scatter search
- job shop scheduling problem
- single machine
- genetic algorithm
- hybrid algorithm
- vehicle routing problem
- multi item
- np hard
- greedy algorithm
- parallel machines
- strongly np hard
- precedence constraints
- evolutionary algorithm
- lagrangian relaxation
- optimization problems
- max min
- lot sizing
- special case
- traveling salesman problem
- variable neighborhood search
- objective function