A POLYNOMIAL-TIME ALGORITHM FOR THE GUILLOTINE PALLET LOADING PROBLEM

被引：0
|
作者：
TARNOWSKI, AG
TERNO, J
SCHEITHAUER, G
机构：
来源：
INFOR | 1994年 / 32卷 / 04期
关键词：
CUTTING STOCK PROBLEM; DYNAMIC PROGRAMMING; MINIMIZATION OF LINEAR MODULO FUNCTION; PALLET LOADING PROBLEM;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A polynomial time algorithm is presented for solving the two-dimensional guillotine cutting stock problem where all small rectangles are of the same dimensions (generating pallet loading patterns). It is based on the initial problem decomposition into three subproblems. Two of these subproblems are solved by dynamic programming recurrence in polynomial time and third subproblem is solved during constant time. This algorithm requires the minimization of linear modulo functions. A polynomial time algorithm is used for this purpose.
引用
收藏
页码：275 / 287
页数：13
相关论文
共 50 条
  • [41] Solving the 0-1 Knapsack Problem with Polynomial-Time Quantum Algorithm
    Liu, Hongying
    Nie, Shuzhi
    COMMUNICATIONS AND INFORMATION PROCESSING, PT 2, 2012, 289 : 377 - +
  • [42] Experiments with a strategic oscillation algorithm for the pallet loading problem
    Amaral, ARS
    Wright, M
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2001, 39 (11) : 2341 - 2351
  • [43] A branch-and-cut algorithm for the pallet loading problem
    Alvarez-Valdes, R
    Parreño, F
    Tamarit, JM
    COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (11) : 3007 - 3029
  • [44] A Polynomial-time Solution for the Maximum Subsets Problem
    Challita, Khalil
    Abdo, Jacques Bou
    Farhat, Hikmat
    Makary, Mireille
    IAENG International Journal of Computer Science, 2022, 49 (04)
  • [45] Polynomial-Time Axioms of Choice and Polynomial-Time Cardinality
    Joshua A. Grochow
    Theory of Computing Systems, 2023, 67 : 627 - 669
  • [46] Polynomial-Time Algorithm for Sorting by Generalized Translocations
    Yin, Xiao
    Zhu, Daming
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, 2009, 5532 : 440 - 449
  • [47] A polynomial-time algorithm for global value numbering
    Gulwani, S
    Necula, GC
    STATIC ANALYSIS, PROCEEDINGS, 2004, 3148 : 212 - 227
  • [48] A polynomial-time algorithm for finding ε in DEA models
    Amin, GR
    Toloo, M
    COMPUTERS & OPERATIONS RESEARCH, 2004, 31 (05) : 803 - 805
  • [49] Polynomial-Time Algorithm for Sliding Tokens on Trees
    Demaine, Erik D.
    Demaine, Martin L.
    Fox-Epstein, Eli
    Hoang, Duc A.
    Ito, Takehiro
    Ono, Hirotaka
    Otachi, Yota
    Uehara, Ryuhei
    Yamada, Takeshi
    ALGORITHMS AND COMPUTATION, ISAAC 2014, 2014, 8889 : 389 - 400
  • [50] A polynomial-time algorithm for memory space reduction
    Song, YH
    Wang, C
    Li, ZY
    INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 2005, 33 (01) : 1 - 33
12345