论文信息 - Faster approximation algorithms for scheduling tasks with a choice of start times

Faster approximation algorithms for scheduling tasks with a choice of start times

We consider the problem of determining the largest independent set in a set of horizontal intervals, where two intervals are defined to be independent if they are not stabbed by any axis-parallel line. This problem arises naturally in non-preemptive scheduling of tasks on uni-processors. We study a Max SNP-hard restriction of the problem and give a randomized and a deterministic approximation algorithm. The deterministic algorithm is the first with performance ratio strictly greater than1/2 to the best of our knowledge.

Ramesh Krishnamurti | Daya Ram Gaur

[1] J. Mark Keil,et al. On the complexity of scheduling tasks with discrete starting times , 1992, Oper. Res. Lett..

[2] Frits C. R. Spieksma,et al. The complexity of scheduling short tasks with few starting times , 1992 .

[3] Rafail Ostrovsky,et al. Approximation algorithms for the job interval selection problem and related scheduling problems , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[4] Paul Erdös,et al. On a Combinatorial Game , 1973, J. Comb. Theory A.

[5] Frits C. R. Spieksma,et al. Interval selection: Applications, algorithms, and lower bounds , 2003, J. Algorithms.

[6] David K. Y. Yau,et al. Adaptive rate-controlled scheduling for multimedia applications , 1997, MULTIMEDIA '96.

[7] S. Louis Hakimi,et al. Complexity Results for Scheduling Tasks with Discrete Starting Times , 1982, J. Algorithms.

[8] F. Spieksma. On the approximability of an interval scheduling problem , 1999 .

[9] Arnold L. Rosenberg,et al. Scheduling Time-Constrained Communication in Linear Networks , 1998, SPAA.