Irina Shapira

Learn More
We consider the problem of scheduling jobs that are given as <i>groups</i> of non-intersecting segments on the real line. Each job <i>J<inf>j</inf></i> is associated with an interval, <i>I<inf>j</inf>,</i> which consists of up to <i>t</i> segments, for some <i>t</i> &#8805; 1, a positive weight, <i>w<inf>j</inf>,</i> and two jobs are in conflict if any of(More)
  • 1