Combining simulation with a GRASP metaheuristic for solving the permutation flow-shop problem with stochastic processing times.
Daniele FeronePaola FestaAljoscha GrulerAngel A. JuanPublished in: WSC (2016)
Keyphrases
- processing times
- metaheuristic
- tabu search
- makespan minimization
- scheduling problem
- combinatorial optimization
- flowshop
- single machine
- simulated annealing
- path relinking
- ant colony optimization
- optimization problems
- scatter search
- polynomially solvable
- vehicle routing problem
- single machine scheduling problem
- mip solver
- genetic algorithm
- combinatorial optimization problems
- grasp with path relinking
- optimal solution
- feasible solution
- iterated local search
- total weighted tardiness
- memetic algorithm
- job shop scheduling problem
- setup times
- suboptimal solutions
- release dates
- search space
- branch and bound
- benchmark instances
- particle swarm optimization
- special case
- variable neighborhood search
- search procedure
- solution quality
- monte carlo
- traveling salesman problem
- hybrid algorithm
- dynamic programming
- harmony search
- resource consumption
- np hard
- heuristic methods