Login / Signup

An efficient network-based formulation for sequence dependent setup scheduling on parallel identical machines.

Bradley E. AndersonJames D. BlocherKurt M. BretthauerMunirpallam A. Venkataramanan
Published in: Math. Comput. Model. (2013)
Keyphrases
  • identical machines
  • processing times
  • scheduling problem
  • single machine
  • job scheduling
  • polynomial time approximation
  • precedence constraints
  • setup times
  • scheduling jobs
  • np hard
  • flowshop