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 条
  • [41] Lower bounds for a bin packing problem with linear usage cost
    Braune, Roland
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 274 (01) : 49 - 64
  • [42] Lower and upper bounds for the Bin Packing Problem with Fragile Objects
    Clautiaux, Francois
    Dell'Amico, Mauro
    Iori, Manuel
    Khanafer, Ali
    DISCRETE APPLIED MATHEMATICS, 2014, 163 : 73 - 86
  • [43] New lower bounds for certain classes of bin packing algorithms
    Balogh, Janos
    Bekesi, Jozsef
    Galambos, Gabor
    THEORETICAL COMPUTER SCIENCE, 2012, 440 : 1 - 13
  • [44] A New Lower Bound for Classic Online Bin Packing
    János Balogh
    József Békési
    György Dósa
    Leah Epstein
    Asaf Levin
    Algorithmica, 2021, 83 : 2047 - 2062
  • [45] PARAMETRIC LOWER BOUND FOR ONLINE BIN-PACKING
    GALAMBOS, G
    SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1986, 7 (03): : 362 - 367
  • [46] A New Lower Bound for Classic Online Bin Packing
    Balogh, Janos
    Bekesi, Jozsef
    Dosa, Gyorgy
    Epstein, Leah
    Levin, Asaf
    APPROXIMATION AND ONLINE ALGORITHMS (WAOA 2019), 2020, 11926 : 18 - 28
  • [47] A New Lower Bound for Classic Online Bin Packing
    Balogh, Janos
    Bekesi, Jozsef
    Dosa, Gyorgy
    Epstein, Leah
    Levin, Asaf
    ALGORITHMICA, 2021, 83 (07) : 2047 - 2062
  • [48] Semi-online scheduling problems on a small number of machines
    Lee, Kangbok
    Lim, Kyungkuk
    JOURNAL OF SCHEDULING, 2013, 16 (05) : 461 - 477
  • [49] Semi-online hierarchical scheduling problems with buffer or rearrangements
    Chen, Xin
    Xu, Zhenzhen
    Dosa, Gyoergy
    Han, Xin
    Jiang, He
    INFORMATION PROCESSING LETTERS, 2013, 113 (04) : 127 - 131
  • [50] Semi-online algorithms for parallel machine scheduling problems
    Dósa, G
    He, Y
    COMPUTING, 2004, 72 (3-4) : 355 - 363
12345