Online scheduling with machine cost and rejection

In this paper we define and investigate a new scheduling model. In this new model the number of machines is not fixed; the algorithm has to purchase the used machines, moreover the jobs can be rejected. We show that the simple combinations of the algorithms used in the area of scheduling with rejections and the area of scheduling with machine cost are not constant competitive. We present a 2.618-competitive algorithm called OPTCOPY.

[1]  Jirí Sgall,et al.  On-line Scheduling , 1996, Online Algorithms.

[2]  Yong He,et al.  Better Online Algorithms for Scheduling with Machine Cost , 2004, SIAM J. Comput..

[3]  David R. Karger,et al.  Techniques for scheduling with rejection , 1998, J. Algorithms.

[4]  Leen Stougie,et al.  Multiprocessor scheduling with rejection , 1996, SODA '96.

[5]  Yong He,et al.  Preemptive online algorithms for scheduling with machine cost , 2005, Acta Informatica.

[6]  Yong He,et al.  Scheduling with machine cost and rejection , 2006, J. Comb. Optim..

[7]  Steven S. Seiden,et al.  A guessing game and randomized online algorithms , 2000, STOC '00.

[8]  Yong He,et al.  Semi-online scheduling with machine cost , 2008, Journal of Computer Science and Technology.

[9]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[10]  Jirí Sgall,et al.  Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines , 1999, ESA.

[11]  Gerhard J. Woeginger,et al.  Online Algorithms , 1998, Lecture Notes in Computer Science.

[12]  Jirí Sgall,et al.  Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines , 1999, ESA.

[13]  Gerhard J. Woeginger,et al.  Developments from a June 1996 seminar on Online algorithms: the state of the art , 1998 .

[14]  Steven S. Seiden.  Preemptive multiprocessor scheduling with rejection , 2001, Theor. Comput. Sci..

[15]  Csanád Imreh,et al.  On-line scheduling with general machine cost functions , 2006, Electron. Notes Discret. Math..

[16]  John Noga,et al.  Scheduling with Machine Cost , 1999, RANDOM-APPROX.