A near-optimal solution to a two-dimensional cutting stock problem

被引：138
|
作者：
Kenyon, C
Rémila, E
机构：
[1] Univ Paris Sud, LRI, F-91405 Orsay, France
[2] Univ St Etienne, IUT Roanne, Grima, F-42334 Roanne, France
[3] Ecole Normale Super Lyon, CNRS, Umr 5668, F-69364 Lyon, France
来源：
MATHEMATICS OF OPERATIONS RESEARCH | 2000年 / 25卷 / 04期
关键词：
cutting-stock; strip-packing; fully polynomial approximation scheme;
D O I：
10.1287/moor.25.4.645.12118
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We present an asymptotic fully polynomial approximation scheme for strip-packing, or packing rectangles into a rectangle of fixed width and minimum height, a classical NP-hard cutting-stock problem. The algorithm, based on a new linear-programming relaxation, finds a packing of n rectangles whose total height is within a factor of(1 + epsilon) of optimal (up to an additive term), and has running time polynomial both in n and in 1/epsilon.
引用
收藏
页码：645 / 656
页数：12
相关论文
共 50 条
  • [21] Improvement in the Herz recursive algorithm for the two-dimensional cutting stock problem
    Hifi, M
    Zissimopoulos, V
    RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 1996, 30 (02): : 111 - 125
  • [22] An improved heuristic for the two-dimensional cutting stock problem with multiple sized stock sheets
    El-Bouri, Ahmed
    Rao, Jinsong
    Popplewell, Neil
    Balakrishnan, S.
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE, 2006, 13 (02): : 198 - 206
  • [23] Two-dimensional cutting stock problem with sequence dependent setup times
    Wuttke, David A.
    Heese, H. Sebastian
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 265 (01) : 303 - 315
  • [24] An improved heuristic for the two-dimensional cutting stock problem with multiple sized stock sheets
    Department of Mechanical and Industrial Engineering, Ryerson University, 0350 Victoria St., Toronto, M5B 2K3, Canada
    不详
    Int J Ind Eng Theory Appl Pract, 2006, 2 (198-206):
  • [25] The two-dimensional cutting stock problem with usable leftovers and uncertainty in demand
    Nascimento, Douglas Nogueira
    Cherri, Adriana Cristina
    Oliveira, Jose Fernando
    COMPUTERS & INDUSTRIAL ENGINEERING, 2023, 186
  • [26] A sequential heuristic procedure for the two-dimensional cutting-stock problem
    Suliman, SMA
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2006, 99 (1-2) : 177 - 185
  • [27] A pattern combination based approach to two-dimensional Cutting Stock Problem
    Wan, JM
    Wu, YD
    Dai, HW
    ADVANCES IN NATURAL COMPUTATION, PT 3, PROCEEDINGS, 2005, 3612 : 332 - 336
  • [28] Near-optimal solution to an employee assignment problem with seniority
    Hojati, Mehran
    ANNALS OF OPERATIONS RESEARCH, 2010, 181 (01) : 539 - 557
  • [29] Near-optimal solution to an employee assignment problem with seniority
    Mehran Hojati
    Annals of Operations Research, 2010, 181 : 539 - 557
  • [30] Solving two-dimensional cutting stock problem via a DNA computing algorithm
    M. Dodge
    S. A. MirHassani
    F. Hooshmand
    Natural Computing, 2021, 20 : 145 - 159
12345