Improved lower bounds for the online bin stretching problem

被引：7
|
作者：
Gabay, Michael [1 ]
Brauner, Nadia [1 ]
Kotov, Vladimir [2 ]
机构：
[1] Univ Grenoble Alpes, CNRS, G SCOP, F-38000 Grenoble, France
[2] Belarusian State Univ, FPMI DMA Dept, 4 Nezavisimosti Ave, Minsk 220030, BELARUS
来源：
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH | 2017年 / 15卷 / 02期
关键词：
Bin stretching; Scheduling; Online algorithms; Lower bounds; ALGORITHM;
D O I：
10.1007/s10288-016-0330-2
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We use game theory techniques to automatically compute improved lower bounds on the competitive ratio for the bin stretching problem. Using these techniques, we improve the best lower bound for this problem to 19/14. We explain the technique and show that it can be generalized to compute lower bounds for any online or semi-online packing or scheduling problem.
引用
收藏
页码：183 / 199
页数：17
相关论文
共 50 条
  • [1] Improved lower bounds for the online bin stretching problem
    Michaël Gabay
    Nadia Brauner
    Vladimir Kotov
    [J]. 4OR, 2017, 15 : 183 - 199
  • [2] Discovering and certifying lower bounds for the online bin stretching problem
    Bohm, Martin
    Simon, Bertrand
    [J]. THEORETICAL COMPUTER SCIENCE, 2022, 938 : 1 - 15
  • [3] Improved lower bounds for the online bin packing problem with cardinality constraints
    Fujiwara, Hiroshi
    Kobayashi, Koji
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2015, 29 (01) : 67 - 87
  • [4] Improved lower bounds for the online bin packing problem with cardinality constraints
    Hiroshi Fujiwara
    Koji Kobayashi
    [J]. Journal of Combinatorial Optimization, 2015, 29 : 67 - 87
  • [5] Improved lower bounds for semi-online bin packing problems
    Balogh, Janos
    Bekesi, Jozsef
    Galambos, Gabor
    Markot, Mihaly Csaba
    [J]. COMPUTING, 2009, 84 (1-2) : 139 - 148
  • [6] Improved lower bounds for semi-online bin packing problems
    János Balogh
    József Békési
    Gábor Galambos
    Mihály Csaba Markót
    [J]. Computing, 2009, 84 : 139 - 148
  • [7] Colored Bin Packing: Online Algorithms and Lower Bounds
    Martin Böhm
    György Dósa
    Leah Epstein
    Jiří Sgall
    Pavel Veselý
    [J]. Algorithmica, 2018, 80 : 155 - 184
  • [8] Colored Bin Packing: Online Algorithms and Lower Bounds
    Bohm, Martin
    Dosa, Gyorgy
    Epstein, Leah
    Sgall, Jiri
    Vesely, Pavel
    [J]. ALGORITHMICA, 2018, 80 (01) : 155 - 184
  • [9] Lower Bounds for Several Online Variants of Bin Packing
    János Balogh
    József Békési
    György Dósa
    Leah Epstein
    Asaf Levin
    [J]. Theory of Computing Systems, 2019, 63 : 1757 - 1780
  • [10] Lower Bounds for Several Online Variants of Bin Packing
    Balogh, Janos
    Bekesi, Jozsef
    Dosa, Gyoergy
    Epstein, Leah
    Levin, Asaf
    [J]. THEORY OF COMPUTING SYSTEMS, 2019, 63 (08) : 1757 - 1780
12345