Login / Signup

A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage.

Henry W. ThorntonJohn L. Hunsucker
Published in: Eur. J. Oper. Res. (2004)
Keyphrases
  • scheduling problem
  • optimal solution
  • list scheduling
  • search algorithm
  • data storage
  • lower bound