Login / Signup

An improved algorithm for due-window assignment on parallel identical machines with unit-time jobs.

Enrique GerstlGur Mosheiov
Published in: Inf. Process. Lett. (2013)
Keyphrases
  • identical machines
  • processing times
  • single machine
  • job scheduling
  • scheduling problem
  • polynomial time approximation
  • scheduling jobs
  • precedence constraints
  • np hard
  • np complete
  • theoretical analysis
  • flowshop