Login / Signup

An approximability result of the multi-vehicle scheduling problem on a path with release and handling times.

Yoshiyuki KarunoHiroshi Nagamochi
Published in: Theor. Comput. Sci. (2004)
Keyphrases
  • scheduling problem
  • single machine
  • pedestrian detection
  • multi depot
  • np hard
  • setup times
  • image sequences
  • shortest path
  • processing times
  • parallel machines
  • precedence constraints
  • urban traffic