The 2-stage assembly flowshop scheduling problem with total completion time: Efficient constructive heuristic and metaheuristic.
Jose M. FramiñanPaz Perez-GonzalezPublished in: Comput. Oper. Res. (2017)
Keyphrases
- metaheuristic
- scheduling problem
- flowshop
- tabu search
- makespan minimization
- constructive heuristic
- variable neighbourhood search
- ant colony optimization
- job processing times
- minimizing makespan
- simulated annealing
- path relinking
- optimal solution
- single machine
- optimization problems
- combinatorial optimization
- scatter search
- processing times
- genetic algorithm
- search space
- vehicle routing problem
- combinatorial optimization problems
- job shop scheduling problem
- np hard
- sequence dependent setup times
- variable neighborhood search
- completion times
- setup times
- hybrid algorithm
- heuristic methods
- benchmark instances
- memetic algorithm
- search methods
- search procedure
- parallel machines
- total weighted tardiness
- special case
- objective function
- feasible solution
- precedence constraints
- particle swarm optimization