Better Algorithms for Online Bin Stretching

Online Bin Stretching is a semi-online variant of bin packing in which the algorithm has to use the same number of bins as the 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.

[1]  Boris Goldengorin,et al.  Handbook of combinatorial optimization , 2013 .

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

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

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

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

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

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

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

[9]  Yossi Azar,et al.  On-Line Bin-Stretching , 1998, RANDOM.

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

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

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

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

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

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

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