Login / Signup

On Minimizing the Expected Makespan and Flow Time in Stochastic Flow Shops with Blocking.

Sung-Hwan WieMichael L. Pinedo
Published in: Math. Oper. Res. (1986)
Keyphrases
  • scheduling problem
  • lower bound
  • processing times
  • batch processing
  • optimal solution
  • database
  • np hard
  • flowshop
  • completion times
  • evolutionary algorithm
  • single machine
  • record linkage
  • stochastic optimization
  • blood flow