A simheuristic algorithm for solving the permutation flow shop problem with stochastic processing times.
Angel A. JuanBarry B. BarriosEva ValladaDaniel RieraJosep JorbaPublished in: Simul. Model. Pract. Theory (2014)
Keyphrases
- processing times
- worst case performance ratio
- np hard
- learning algorithm
- competitive ratio
- single machine scheduling problem
- dynamic programming
- worst case
- combinatorial optimization
- single machine
- search space
- computational complexity
- particle swarm optimization
- scheduling problem
- bin packing
- total weighted tardiness
- makespan minimization