Online scheduling with general machine cost functions

For most scheduling problems the set of machines is fixed initially and remains unchanged for the duration of the problem. Recently online scheduling problems have been investigated with the modification that initially the algorithm possesses no machines, but that at any point additional machines may be purchased. In all of these models the assumption has been made that each machine has unit cost. In this paper we consider the problem with general machine cost functions. Furthermore we also consider a more general version of the problem where the available machines have speed, the algorithm may purchase machines with speed 1 and machines with speed s. We define and analyze some algorithms for the solution of these problems and their special cases. Moreover we prove some lower bounds on the possible competitive ratios.

[1]  Amos Fiat,et al.  On-line load balancing with applications to machine scheduling and virtual circuit routing , 1993, STOC.

[2]  Sartaj Sahni,et al.  Bounds for List Schedules on Uniform Processors , 1980, SIAM J. Comput..

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

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

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

[6]  Marek Karpinski,et al.  On-Line Load Balancing for Related Machines , 1997, J. Algorithms.

[7]  Oscar H. Ibarra,et al.  Bounds for LPT Schedules on Uniform Processors , 1977, SIAM J. Comput..

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

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

[10]  Csanád Imreh,et al.  Online scheduling with machine cost and rejection , 2007, Discret. Appl. Math..

[11]  Gerhard J. Woeginger,et al.  Buying a Constant Competitive Ratio for Paging , 2001, ESA.

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

[13]  Csanád Imreh,et al.  Scheduling Problems on Two Sets of Identical Machines , 2003, Computing.

[14]  Amos Fiat,et al.  On-line routing of virtual circuits with applications to load balancing and machine scheduling , 1997, JACM.

[15]  Csanád Imreh.  An online scheduling algorithm for a two-layer multiprocessor architecture , 2001, Acta Cybern..

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