Scheduling split intervals

• Authors: Reuven Bar-Yehuda;Magnús M. Halldórsson;Joseph (Seffi) Naor;Hadas Shachnai;Irina Shapira
• Venue: SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
• Year: 2002

We consider the problem of scheduling jobs that are given as groups of non-intersecting segments on the real line. Each job Jj is associated with an interval, Ij, which consists of up to t segments, for some t ≥ 1, a positive weight, wj, and two jobs are in conflict if any of their segments intersect. Such jobs show up in a wide range of applications, including the transmission of continuous-media data, allocation of linear resources (e.g. bandwidth in linear processor arrays), and in computational biology/geometry. The objective is to schedule a subset of non-conflicting jobs of maximum total weight.In a single machine environment, our problem can be formulated as the problem of finding a maximum weight independent set in a t-interval graph (the special case of t = 1 is an ordinary interval graph). We show that, for t ≥ 2, this problem is APX-hard, even for highly restricted instances. Our main result is a 2t-approximation algorithm for general instances, based on a novel fractional version of the Local Ratio technique. Previously, the problem was considered only for proper union graphs, a restricted subclass of t-interval graphs, and the approximation factor achieved was (2t - 1 + 1/2t). A bi-criteria polynomial time approximation scheme (PTAS) is developed for the subclass of t-union graphs.In the online case, we consider uniform weight jobs that consist of at most two segments. We show that when the resulting 2-interval graph is proper, a simple greedy algorithm is 3-competitive, while any randomized algorithm has competitive ratio at least 2.5. For general instances, we give a randomized O(log2 R)-competitive (or O((log R)2+ε)-competitive) algorithm, where R is the known (unknown) ratio between the longest and the shortest segment in the input sequence.