Stability of probablisitic two-stage permutation flowshop problem.

Zied Bouyahia Monia Bellalouna Khaled Ghédira

Published in: CTW (2015)

Keyphrases

permutation flowshop
scheduling problem
total flowtime
upper bound
greedy algorithm
strongly np hard
single machine
sufficient conditions
genetic algorithm
lower bound
np hard
particle swarm optimization
resource allocation
processing times
precedence constraints