A beam-search-based constructive heuristic for the PFSP to minimise total flowtime.
Victor Fernandez-ViagasJose M. FramiñanPublished in: Comput. Oper. Res. (2017)
Keyphrases
- beam search
- constructive heuristic
- permutation flowshop
- metaheuristic
- minimizing makespan
- search methods
- scheduling problem
- branch and bound
- upper bound
- genetic algorithm
- search algorithm
- heuristic search
- simulated annealing
- lower bound
- optimal solution
- combinatorial optimization
- optimization problems
- hill climbing
- flowshop scheduling
- strongly np hard
- search space
- greedy algorithm
- tabu search
- search problems
- ant colony optimization
- ranking functions
- search heuristics
- flowshop
- search strategies
- single machine
- artificial neural networks
- precedence constraints
- dynamic programming
- np hard
- particle swarm optimization
- information retrieval