Login / Signup

Brief announcement: on the complexity of the minimum latency scheduling problem on the euclidean plane.

Henry LinFrans Schalekamp
Published in: SPAA (2012)
Keyphrases
  • scheduling problem
  • euclidean plane
  • np hard
  • computational complexity
  • single machine
  • real time
  • worst case
  • data sets
  • tabu search
  • information systems
  • parallel machines
  • setup times
  • total tardiness