Login / Signup

A simheuristic algorithm to set up starting times in the stochastic parallel flowshop problem.

Sara HatamiLaura CalvetVictor Fernandez-ViagasJose M. FramiñanAngel A. Juan
Published in: Simul. Model. Pract. Theory (2018)
Keyphrases
  • computational complexity
  • dynamic programming
  • np hard
  • optimal solution
  • cost function
  • objective function
  • search space
  • special case
  • convex hull
  • lower and upper bounds
  • branch and bound algorithm
  • fixed number