Arundhati Bagchi Misra

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the number of jobs completed by their deadlines. Chrobak et al. (2007, SICOMP 36:6) introduce a preempt-restart model in which progress toward completing a preempted job is lost, yet that(More)
  • 1