Online time constrained scheduling with penalties

In this paper we prove the (constant) competitiveness of an online algorithm for scheduling jobs on multiple machines, supporting a mechanism of penalties for the scheduler/operator. Our context (online, multiple machines, supporting parameterizable penalties) is more general than in previous existing works. The main contribution of our paper is the (non trivial) analysis of our algorithm. Moreover, with our parameterizable penalties, the operator can find a trade-off between the attractiveness of its system and its own profit (gained with non canceled scheduled jobs).

[1]  Moti Yung,et al.  Efficient On-Line Call Control Algorithms , 1997, J. Algorithms.

[2]  Evripidis Bampis,et al.  On-Line Simultaneous Maximization of the Size and the Weight for Degradable Intervals Schedules , 2005, COCOON.

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

[4]  Gerhard J. Woeginger,et al.  On-Line Scheduling of Jobs with Fixed Start and End Times , 1994, Theor. Comput. Sci..

[5]  Joseph Naor,et al.  On-line admission control and packet scheduling with interleaving , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[6]  Christian Laforest,et al.  On-line Time-Constrained Scheduling Problem for the Size on \kappa machines , 2005, 8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05).

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

[8]  Ulrich Faigle,et al.  Note on Scheduling Intervals on-line , 1995, Discret. Appl. Math..

[9]  Yossi Azar,et al.  Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms , 1999, SODA '99.

[10]  Stanley P. Y. Fung.  Lower bounds on online deadline scheduling with preemption penalties , 2008, Inf. Process. Lett..

[11]  Joseph Naor,et al.  Online time-constrained scheduling in linear networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

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

[13]  Sally A. Goldman,et al.  On-line Scheduling with Hard Deadlines (Extended Abstract) , 1997, WADS.

[14]  Evripidis Bampis,et al.  On-Line Bicriteria Interval Scheduling , 2005, Euro-Par.

[15]  Ran Canetti,et al.  Bandwidth Allocation with Preemption , 1999, SIAM J. Comput..

[16]  Michael H. Goldwasser.  Patience is a Virtue: The Effect of Slack on Competitiveness for Admission Control , 1999, SODA '99.

[17]  Yin-Feng Xu,et al.  On-line production order scheduling with preemption penalties , 2007, J. Comb. Optim..