A two-phase algorithm for bin stretching with stretching factor 1.5

Online Bin Stretching is a semi-online variant of bin packing in which the algorithm has to use the same number of bins as an optimal packing, but is allowed to slightly overpack the bins. The goal is to minimize the amount of overpacking, i.e., the maximum size packed into any bin.We give an algorithm for Online Bin Stretching with a stretching factor of 1.5 for any number of bins. We build on previous algorithms and use a two-phase approach. However, our analysis is technically more complicated and uses amortization over the bins with the help of two weight functions.

[1]  Susanne Albers,et al.  Semi-online scheduling revisited , 2012, Theor. Comput. Sci..

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

[3]  Nadia Brauner,et al.  Semi-Online Bin Stretching with Bunch Techniques , 2013 .

[4]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[5]  Daniele Vigo,et al.  Bin packing approximation algorithms: Survey and classification , 2013 .

[6]  Yossi Azar,et al.  On-line bin-stretching , 1998, Theor. Comput. Sci..

[7]  Hans Kellerer,et al.  An efficient algorithm for bin stretching , 2013, Oper. Res. Lett..

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

[9]  Jeffrey D. Ullman,et al.  The performance of a memory allocation algorithm , 1971 .

[10]  Jirí Sgall,et al.  The Best Two-Phase Algorithm for Bin Stretching , 2016, ArXiv.

[11]  Jirí Sgall,et al.  Preemptive Online Scheduling: Optimal Algorithms for All Speeds , 2006, ESA.

[12]  N. Brauner,et al.  Computing Lower Bounds for Semi-Online Optimization Problems: Application to the Bin Stretching , 2013 .

[13]  Marek Karpinski,et al.  On-line Load Balancing for Related Machines , 1997, WADS.

[14]  David S. Johnson,et al.  Near-optimal bin packing algorithms , 1973 .

[15]  Zsolt Tuza,et al.  Semi on-line algorithms for the partition problem , 1997, Oper. Res. Lett..

[16]  Jirí Sgall,et al.  Better Algorithms for Online Bin Stretching , 2014, WAOA.

[17]  Jirí Sgall,et al.  Online bin stretching with three bins , 2014, Journal of Scheduling.

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

[19]  Nadia Brauner,et al.  Improved lower bounds for the online bin stretching problem , 2016, 4OR.