Stochastically minimizing total flowtime in flowshops with no waiting space.

Published in: Eur. J. Oper. Res. (1999)

Keyphrases

total flowtime
minimizing makespan
permutation flowshop
scheduling problem
flowshop
flowshop scheduling
flowshop scheduling problems
upper bound
neural network
processing times
parallel machines
tabu search
np hard
random variables