A new lower bound for online strip packing

被引：6
|
作者：
Yu, Guosong [1 ]
Mao, Yanling [2 ]
Xiao, Jiaoliao [2 ]
机构：
[1] Nanchang Univ, Dept Math, Nanchang 330031, Peoples R China
[2] Nanchang Univ, Dept Management Sci & Engn, Nanchang 330031, Peoples R China
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2016年 / 250卷 / 03期
基金：
中国国家自然科学基金;
关键词：
Packing; Strip packing; Online algorithm; Competitive ratio; PARALLEL JOBS; ALGORITHMS;
D O I：
10.1016/j.ejor.2015.10.012
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this paper, we consider the online strip packing problem, in which a list of online rectangles has to be packed without overlap or rotation into a strip of width 1 and infinite length so as to minimize the required height of the packing. We derive a new improved lower bound of (3 + root 5)/2 approximate to 2.618 for the competitive ratio for this problem. This result improves the best known lower bound of 2.589. (C) 2015 Elsevier B.V. and Association of European Operational Research Societies (EURO) within the International Federation of Operational Research Societies (IFORS). All rights reserved.
引用
收藏
页码：754 / 759
页数：6
相关论文
共 50 条
  • [1] Improved Lower Bound for Online Strip Packing
    Rolf Harren
    Walter Kern
    [J]. Theory of Computing Systems, 2015, 56 : 41 - 72
  • [2] Improved Lower Bound for Online Strip Packing
    Harren, Rolf
    Kern, Walter
    [J]. THEORY OF COMPUTING SYSTEMS, 2015, 56 (01) : 41 - 72
  • [3] A new upper bound for the online square packing problem in a strip
    Guosong Yu
    Yanling Mao
    Jiaoliao Xiao
    [J]. Journal of Combinatorial Optimization, 2017, 33 : 1411 - 1420
  • [4] A new upper bound for the online square packing problem in a strip
    Yu, Guosong
    Mao, Yanling
    Xiao, Jiaoliao
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 33 (04) : 1411 - 1420
  • [5] 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
    [J]. Algorithmica, 2021, 83 : 2047 - 2062
  • [6] A New Lower Bound for Classic Online Bin Packing
    Balogh, Janos
    Bekesi, Jozsef
    Dosa, Gyorgy
    Epstein, Leah
    Levin, Asaf
    [J]. ALGORITHMICA, 2021, 83 (07) : 2047 - 2062
  • [7] A New Lower Bound for Classic Online Bin Packing
    Balogh, Janos
    Bekesi, Jozsef
    Dosa, Gyorgy
    Epstein, Leah
    Levin, Asaf
    [J]. APPROXIMATION AND ONLINE ALGORITHMS (WAOA 2019), 2020, 11926 : 18 - 28
  • [8] A LOWER BOUND FOR ONLINE BIN PACKING
    LIANG, FM
    [J]. INFORMATION PROCESSING LETTERS, 1980, 10 (02) : 76 - 79
  • [9] A lower bound for online rectangle packing
    Leah Epstein
    [J]. Journal of Combinatorial Optimization, 2019, 38 : 846 - 866
  • [10] A lower bound for online rectangle packing
    Epstein, Leah
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2019, 38 (03) : 846 - 866
12345