Worst-case analysis of the FFH algorithm for online variable-sized bin packing

被引：9
|
作者：
Zhang, G
机构：
[1] Institute of Applied Mathematics, Academia Sinica, Beijing
来源：
COMPUTING | 1996年 / 56卷 / 02期
关键词：
combinatorial problems; bin packing; online algorithm; worst-case analysis;
D O I：
10.1007/BF02309343
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We investigate and analyze the FFH algorithm proposed by Kinnersley and Langston [5]. We prove that the tight worst-case performance bound of FFH algorithm is 1.7, thereby answering a question in [5]. The case that bin sizes can be chosen is also considered.
引用
收藏
页码：165 / 172
页数：8
相关论文
共 50 条
  • [21] Algorithms for the variable-sized bin packing problem with time windows
    Liu, Qiang
    Cheng, Huibing
    Tian, Tian
    Wang, Yongsheng
    Leng, Jiewu
    Zhao, Rongli
    Zhang, Hao
    Wei, Lijun
    COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 155
  • [22] Variable-sized bin packing problem with conflicts and item fragmentation
    Ekici, Ali
    COMPUTERS & INDUSTRIAL ENGINEERING, 2022, 163
  • [23] Packing optimization of rectangle workpieces oriented to variable-sized bin
    Guangdong Provincial Key Laboratory of Computer Integrated Manufacturing System, Guangdong University of Technology, Guangzhou
    510006, China
    不详
    510430, China
    Jisuanji Jicheng Zhizao Xitong, 11 (2921-2928):
  • [24] The Bin Packing Problem with Item Fragmentation: A worst-case analysis
    Bertazzi, Luca
    Golden, Bruce
    Wang, Xingyin
    DISCRETE APPLIED MATHEMATICS, 2019, 261 : 63 - 77
  • [25] A hybrid heuristic algorithm for the 2D problem variable-sized bin packing
    Hong, Shaohui
    Zhang, Defu
    Lau, Hoong Chuin
    Zeng, XiangXiang
    Si, Yain-Whar
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 238 (01) : 95 - 103
  • [26] Variable-sized bin packing problem with conflicts and item fragmentation
    Ekici, Ali
    Computers and Industrial Engineering, 2022, 163
  • [27] A new version of on-line variable-sized bin packing
    Zhang, GC
    DISCRETE APPLIED MATHEMATICS, 1997, 72 (03) : 193 - 197
  • [28] A large neighborhood search algorithm and lower bounds for the variable-Sized bin packing problem with conflicts
    Ekici, Ali
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 308 (03) : 1007 - 1020
  • [29] A goal-driven approach to the 2D bin packing and variable-sized bin packing problems
    Wei, Lijun
    Oon, Wee-Chong
    Zhu, Wenbin
    Lim, Andrew
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2013, 224 (01) : 110 - 121
  • [30] On variable-sized multidimensional packing
    Epstein, L
    van Stee, R
    ALGORITHMS ESA 2004, PROCEEDINGS, 2004, 3221 : 287 - 298
12345