Breaking 1 - 1/e Barrier for Non-preemptive Throughput Maximization

In this paper we consider one of the most basic scheduling problems where jobs have their respective arrival times and deadlines. The goal is to schedule as many jobs as possible non-preemptively by their respective deadlines on m identical parallel machines. For the last decade, the best approximation ratio known for the single machine case (\(m = 1\)) has been \(1-1/e - \epsilon \approx 0.632\) due to [Chuzhoy-Ostrovsky-Rabani, FOCS 2001 and MOR 2006]. We break this barrier and give an improved 0.644-approximation. For the multiple machine case, we give an algorithm whose approximation guarantee becomes arbitrarily close to 1 as the number of machines increases. This improves upon the previous best \(1 - 1/(1 + 1/m)^m\) approximation due to [Bar-Noy et al., STOC 1999 and SICOMP 2009], which converges to \(1-1/e\) as m goes to infinity. Our result for the multiple-machine case extends to the weighted throughput objective where jobs have different weights, and the goal is to schedule jobs with the maximum total weight. Our results show that the \(1 - 1/e\) approximation factor widely observed in various coverage problems is not tight for the non-preemptive maximum throughput scheduling problem.

[1]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[2]  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.

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

[4]  David S. Johnson,et al.  Two-Processor Scheduling with Start-Times and Deadlines , 1977, SIAM J. Comput..

[5]  C. McDiarmid.  Concentration , 1862, The Dental register.

[6]  Piotr Berman,et al.  Improvements in throughout maximization for real-time scheduling , 2000, STOC '00.

[7]  Arnold L. Rosenberg,et al.  Scheduling Time-Constrained Communication in Linear Networks , 2002, SPAA '98.

[8]  Klaus H. Ecker,et al.  Scheduling Computer and Manufacturing Processes , 2001 .

[9]  Matteo Fischetti,et al.  The Fixed Job Schedule Problem with Spread-Time Constraints , 1987, Oper. Res..

[10]  Philippe Baptiste,et al.  An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs , 1999, Oper. Res. Lett..

[11]  Eugene L. Lawler,et al.  Chapter 9 Sequencing and scheduling: Algorithms and complexity , 1993, Logistics of Production and Inventory.

[12]  Asaf Shapira,et al.  Approximate Hypergraph Partitioning and Applications , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[13]  Joseph Y.-T. Leung,et al.  Preemptive scheduling with release times and deadlines , 2004, Real-Time Systems.

[14]  Richard J. Lipton,et al.  Online interval scheduling , 1994, SODA '94.

[15]  Nicholas G. Hall,et al.  Maximizing the value of a space mission , 1994 .

[16]  Kirk Pruhs,et al.  Non-Preemptive Min-Sum Scheduling with Resource Augmentation , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[17]  Dennis Shasha,et al.  D^over: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems , 1995, SIAM J. Comput..

[18]  Sudipto Guha,et al.  Approximating the Throughput of Multiple Machines in Real-Time Scheduling , 2002, SIAM J. Comput..