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 条
  • [21] A tight lower bound for the online bounded space hypercube bin packing problem
    Kohayakawa, Yoshiharu
    Miyazawa, Flavio Keidi
    Wakabayashi, Yoshiko
    [J]. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2021, 23 (03):
  • [22] A New Probabilistic Lower Bound on the Limited Packing Number of a Graph
    Mohammadi, Mehdi
    Rad, Nader Jafari
    Maghasedi, Mohammad
    [J]. UTILITAS MATHEMATICA, 2020, 114 : 249 - 254
  • [23] A new lower bound on the price of anarchy of selfish bin packing
    Dosa, Gyorgy
    Epstein, Leah
    [J]. INFORMATION PROCESSING LETTERS, 2019, 150 : 6 - 12
  • [24] A branch and bound algorithm for the strip packing problem
    Alvarez-Valdes, R.
    Parreno, F.
    Tamarit, J. M.
    [J]. OR SPECTRUM, 2009, 31 (02) : 431 - 459
  • [25] A branch and bound algorithm for the strip packing problem
    R. Alvarez-Valdes
    F. Parreño
    J. M. Tamarit
    [J]. OR Spectrum, 2009, 31 : 431 - 459
  • [26] New Lower Bounds for the Three-Dimensional Strip Packing Problem
    Hoffmann, Kirsten
    [J]. OPERATIONS RESEARCH PROCEEDINGS 2013, 2014, : 201 - 207
  • [27] A SIMPLE PROOF OF LIANG LOWER BOUND FOR ONLINE BIN PACKING AND THE EXTENSION TO THE PARAMETRIC CASE
    GALAMBOS, G
    FRENK, JBG
    [J]. DISCRETE APPLIED MATHEMATICS, 1993, 41 (02) : 173 - 178
  • [28] A Tight Lower Bound for an Online Hypercube Packing Problem and Bounds for Prices of Anarchy of a Related Game
    Kohayakawa, Yoshiharu
    Miyazawa, Flavio Keidi
    Wakabayashi, Yoshiko
    [J]. LATIN 2018: THEORETICAL INFORMATICS, 2018, 10807 : 697 - 711
  • [29] A New Upper Bound 2.5545 on 2D Online Bin Packing
    Han, Xin
    Chin, Francis Y. L.
    Ting, Hing-Fung
    Zhang, Guochuan
    Zhang, Yong
    [J]. ACM TRANSACTIONS ON ALGORITHMS, 2011, 7 (04)
  • [30] Online algorithm for parallel job scheduling and strip packing
    Hurink, Johann L.
    Paulus, Jacob Jan
    [J]. APPROXIMATION AND ONLINE ALGORITHMS, 2008, 4927 : 67 - 74
12345