Makespan distribution of permutation flowshop schedules.

Feng Jin Jatinder N. D. Gupta Shiji Song Cheng Wu

Published in: J. Sched. (2008)

Keyphrases

permutation flowshop
scheduling problem
total flowtime
flowshop
single machine
strongly np hard
np hard
precedence constraints
minimizing makespan
upper bound
setup times
processing times
tabu search
probability distribution
parallel machines
release dates
sequence dependent setup times
greedy algorithm
multistage