Login / Signup

A penalty-shift-insertion-based algorithm to minimize total flow time in no-wait flow shops.

Dipak LahaJatinder N. D. GuptaSagar U. Sapkal
Published in: J. Oper. Res. Soc. (2014)
Keyphrases
  • dynamic programming
  • learning algorithm
  • objective function
  • np hard
  • simulated annealing
  • optimal solution
  • computational complexity