Improved lower bounds for semi-online bin packing problems

被引：4
|
作者：
Balogh, Janos [3 ]
Bekesi, Jozsef [3 ]
Galambos, Gabor [3 ]
Markot, Mihaly Csaba [1 ,2 ]
机构：
[1] Univ Vienna, Fac Math, A-1090 Vienna, Austria
[2] European Space Agcy, Estec, Adv Concepts Team, Noordwijk, Netherlands
[3] Univ Szeged, Dept Informat Applicat, Gyula Juhasz Fac Educ, H-6725 Szeged, Hungary
来源：
COMPUTING | 2009年 / 84卷 / 1-2期
基金：
奥地利科学基金会;
关键词：
Semi-online bin packing problems; Nonlinear optimization; Branch-and-bound; Interval arithmetic;
D O I：
10.1007/s00607-008-0023-6
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In the paper we deal with lower bounds constructed for the asymptotic competitive ratio of semi-online bin packing and batched bin packing algorithms.We determine the bounds as the solutions of a related nonlinear optimization problem using theoretical analysis and a reliable numerical global optimization method. Our results improve the lower bounds given in Gutin et al. (Discrete Optim 2:71-82, 2005) for some special cases of the batched bin packing problem.
引用
收藏
页码：139 / 148
页数：10
相关论文
共 50 条
  • [21] Lower bounds for online bin covering-type problems
    János Balogh
    Leah Epstein
    Asaf Levin
    Journal of Scheduling, 2019, 22 : 487 - 497
  • [22] Lower bounds for online bin covering-type problems
    Balogh, Janos
    Epstein, Leah
    Levin, Asaf
    JOURNAL OF SCHEDULING, 2019, 22 (04) : 487 - 497
  • [23] Lower bounds for three-dimensional multiple-bin-size bin packing problems
    Alvarez-Valdes, R.
    Parreno, F.
    Tamarit, J. M.
    OR SPECTRUM, 2015, 37 (01) : 49 - 74
  • [24] Lower bounds for three-dimensional multiple-bin-size bin packing problems
    R. Alvarez-Valdes
    F. Parreño
    J. M. Tamarit
    OR Spectrum, 2015, 37 : 49 - 74
  • [25] Bounds for online bin packing with cardinality constraints
    Bekesi, Jozsef
    Dosa, Gyorgy
    Epstein, Leah
    INFORMATION AND COMPUTATION, 2016, 249 : 190 - 204
  • [26] Tight Bounds for Online Vector Bin Packing
    Azar, Yossi
    Cohen, Ilan
    Kamara, Seny
    Shepherd, Bruce
    STOC'13: PROCEEDINGS OF THE 2013 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2013, : 961 - 970
  • [27] New bin packing fast lower bounds
    Crainic, Teodor Gabriel
    Perboli, Guido
    Pezzuto, Miriam
    Tadei, Roberto
    COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (11) : 3439 - 3457
  • [28] A LOWER BOUND FOR ONLINE BIN PACKING
    LIANG, FM
    INFORMATION PROCESSING LETTERS, 1980, 10 (02) : 76 - 79
  • [29] Lower Bounds on the Performance of Online Algorithms for Relaxed Packing Problems
    Balogh, Janos
    Dosa, Gyorgy
    Epstein, Leah
    Jez, Lukasz
    COMBINATORIAL ALGORITHMS (IWOCA 2022), 2022, 13270 : 101 - 113
  • [30] Tight lower bounds for semi-online scheduling on two uniform machines with known optimum
    Dosa, Gyorgy
    Fuegenschuh, Armin
    Tan, Zhiyi
    Tuza, Zsolt
    Wesek, Krzysztof
    CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2019, 27 (04) : 1107 - 1130
12345