Online scheduling to minimize modified total tardiness with an availability constraint

We consider online scheduling problems to minimize modified total tardiness. The problems are online in the sense that jobs arrive over time. For each job J"j, its processing time p"j, due date d"j and weight w"j become known at its arrival time (or release time) r"j. Preemption is not allowed. We first show that there is no finite competitive ratio for problem 1|online,r"j,d"j|@?w"jT"j. So we focus on problem 1|online,r"j,d"j|@?w"j(T"j+d"j) and show that D-SWPT (Delayed Shortest Weighted Processing Time) algorithm is 3-competitive. We further study two problems 1|online,r"j,d"j,h(1),res|@?w"j(T"j+d"j) and 1|online,r"j,d"j,h(1),N-res|@?w"j(T"j+d"j), where res and N-res denote resumable and non-resumable models respectively, and h(1) denotes a non-available time interval [s,@as] with s>0 and @a>=1. We give a lower bound of 1+@a for both problems and prove that M-D-SWPT (Modified D-SWPT) is 3@a and 6@a-competitive in the resumable and non-resumable models, respectively. Moreover, we extend the upper bounds to the scenario of parallel machine scheduling with uniform job weight and an assumption that all machines have the same non-available time interval [s,@as]. A lower bound of min{@a,1+@am} is given as well for the scenario.

[1]  Leen Stougie,et al.  A class of on-line scheduling algorithms to minimize total completion time , 2003, Oper. Res. Lett..

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

[3]  Xiwen Lu,et al.  Online scheduling of two uniform machines to minimize total completion times , 2008 .

[4]  Stavros G. Kolliopoulos,et al.  Approximation algorithms for scheduling problems with a modified total weighted tardiness objective , 2007, Oper. Res. Lett..

[5]  Chengbin Chu,et al.  Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period , 2008, Eur. J. Oper. Res..

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

[7]  Weizhen Mao,et al.  Competitive online scheduling of perfectly malleable jobs with setup times , 2008, Eur. J. Oper. Res..

[8]  Rajeev Motwani,et al.  Approximation techniques for average completion time scheduling , 1997, SODA '97.

[9]  Hans Kellerer,et al.  Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval , 2009, Eur. J. Oper. Res..

[10]  Nicole Megow,et al.  On-line scheduling to minimize average completion time revisited , 2004, Oper. Res. Lett..

[11]  Zhang Yu-zhong.  ON-LINE PREEMPTIVE SCHEDULING ON UNIFORM MACHINES , 2001 .

[12]  Chris N. Potts,et al.  On-line scheduling of a single machine to minimize total weighted completion time , 2002, SODA '02.

[13]  Yong He,et al.  Optimal online algorithm for scheduling on two identical machines with machine availability constraints , 2002, Inf. Process. Lett..

[14]  Joseph Y.-T. Leung,et al.  Handbook of Scheduling: Algorithms, Models, and Performance Analysis , 2004 .

[15]  David B. Shmoys,et al.  Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms , 1997, Math. Oper. Res..

[16]  Xiwen Lu,et al.  On-line scheduling of parallel machines to minimize total completion times , 2009, Comput. Oper. Res..

[17]  Apa Arjen Vestjens.  On-line machine scheduling , 1997 .

[18]  Rob van Stee,et al.  Minimizing the total completion time on-line on a single machine, using restarts , 2002, J. Algorithms.

[19]  Rob van Stee,et al.  Minimizing the total completion time on-line on a single machine, using restarts , 2005, J. Algorithms.

[20]  Kirk Pruhs,et al.  Online scheduling , 2003 .

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