Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem

We explore the machine-minimizing job scheduling problem, which has a rich history in the line of research, under an online setting. We consider systems with arbitrary job arrival times, arbitrary job deadlines, and unit job execution time. For this problem, we present a lower bound 2.09 on the competitive factor of any online algorithms, followed by designing a 5.2-competitive online algorithm. We would also like to point out a false claim made in an existing paper of Shi and Ye regarding a further restricted case of the considered problem. To the best of our knowledge, what we present is the first concrete result concerning online machine-minimizing job scheduling with arbitrary job arrival times and deadlines.

[1]  Deshi Ye,et al.  Online bin packing with arbitrary release times , 2008, Theor. Comput. Sci..

[2]  O. E. Flippo,et al.  The assembly of printed circuit boards : a case with multiple machines and multiple board types , 1995 .

[3]  Reuven Bar-Yehuda,et al.  A unified approach to approximating resource allocation and scheduling , 2001, JACM.

[4]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

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

[6]  Baruch Schieber,et al.  A quasi-PTAS for unsplittable flow on line graphs , 2006, STOC '06.

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[9]  Leah Epstein,et al.  On the online unit clustering problem , 2007, TALG.

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

[11]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

[12]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[13]  Yuval Rabani,et al.  An improved approximation algorithm for resource allocation , 2011, TALG.

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

[15]  Roshdy H. M. Hafez,et al.  Adaptive rate controlled, robust video communication over packet wireless networks , 1998, Mob. Networks Appl..

[16]  Sudipto Guha,et al.  Machine minimization for scheduling jobs with interval constraints , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[17]  Reuven Bar-Yehuda,et al.  A unified approach to approximating resource allocation and scheduling , 2000, STOC '00.

[18]  Julia Chuzhoy,et al.  Resource Minimization Job Scheduling , 2009, APPROX-RANDOM.

[19]  Joseph Naor,et al.  New hardness results for congestion minimization and machine scheduling , 2004, STOC '04.

[20]  Thomas Erlebach,et al.  Scheduling with Release Times and Deadlines on a Minimum Number of Machines , 2004, IFIP TCS.

[21]  Guochuan Zhang,et al.  Scheduling with a minimum number of machines , 2009, Oper. Res. Lett..

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