Login / Signup

A note on minimizing makespan on a single batch processing machine with nonidentical job sizes.

Ali Husseinzadeh KashanBehrooz KarimiS. M. T. Fatemi Ghomi
Published in: Theor. Comput. Sci. (2009)
Keyphrases
  • minimizing makespan
  • scheduling problem
  • total flowtime
  • flowshop
  • single machine
  • parallel machines
  • onset detection
  • linear programming