A coupling cutting stock-lot sizing problem in the paper industry

被引：0
作者：
Sônia Cristina Poltroniere
Kelly Cristina Poldi
Franklina Maria Bragion Toledo
Marcos Nereu Arenales
机构：
[1] Universidade de São Paulo,Instituto de Ciências Matemáticas e de Computação
来源：
Annals of Operations Research | 2008年 / 157卷
关键词：
Cutting stock problems; Lot sizing and scheduling problems; Lagrangian relaxation;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
An important production programming problem arises in paper industries coupling multiple machine scheduling with cutting stocks. Concerning machine scheduling: how can the production of the quantity of large rolls of paper of different types be determined. These rolls are cut to meet demand of items. Scheduling that minimizes setups and production costs may produce rolls which may increase waste in the cutting process. On the other hand, the best number of rolls in the point of view of minimizing waste may lead to high setup costs. In this paper, coupled modeling and heuristic methods are proposed. Computational experiments are presented.
引用
收藏
页码：91 / 104
页数：13
相关论文
共 36 条
[21]   Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory [J].
Nadjib Brahimi ;
Nabil Absi ;
Stéphane Dauzère-Pérès ;
Safia Kedad-Sidhoum .
OR Spectrum, 2015, 37 :983-1006
[22]   A Lagrangian relaxation based approach for the capacitated lot sizing problem in closed-loop supply chain [J].
Zhang, Zhi-Hai ;
Jiang, Hai ;
Pan, Xunzhang .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2012, 140 (01) :249-255
[23]   Parallelized decomposition approaches for capacitated lot-sizing problems: application to the problem with constraints on ending inventories [J].
Charles, Mehdi ;
Dauzere-Peres, Stephane ;
Kedad-Sidhoum, Safia ;
Mazhoud, Issam .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2025,
[24]   The one-dimensional cutting stock problem with usable leftover - A heuristic approach [J].
Cherri, Adriana Cristina ;
Arenales, Marcos Nereu ;
Yanasse, Horacio Hideki .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 196 (03) :897-908
[25]   Improvement in the Herz recursive algorithm for the two-dimensional cutting stock problem [J].
Hifi, M ;
Zissimopoulos, V .
RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 1996, 30 (02) :111-125
[26]   A Multi-objective Approach for the 2D Guillotine Cutting Stock Problem [J].
de Armas, Jesica ;
Miranda, Gara ;
Leon, Coromoto .
ADVANCES IN COMPUTATIONAL INTELLIGENCE, IWANN 2011, PT II, 2011, 6692 :292-299
[27]   Reformulations to improve the Lagrangian relaxation approach for the capacitated multi-product dynamic lot sizing problem with batch ordering [J].
Bunn, Kevin A. ;
Ventura, Jose A. .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2024, 62 (08) :2868-2887
[28]   Formulations and exact solution approaches for a coupled bin-packing and lot-sizing problem with sequence-dependent setups [J].
Gislaine Mara Melega ;
Silvio Alexandre de Araujo ;
Raf Jans ;
Reinaldo Morabito .
Flexible Services and Manufacturing Journal, 2023, 35 :1276-1312
[29]   Formulations and exact solution approaches for a coupled bin-packing and lot-sizing problem with sequence-dependent setups [J].
Melega, Gislaine Mara ;
de Araujo, Silvio Alexandre ;
Jans, Raf ;
Morabito, Reinaldo .
FLEXIBLE SERVICES AND MANUFACTURING JOURNAL, 2023, 35 (04) :1276-1312
[30]   On the availability and changeover cases of the general lot-sizing and scheduling problem with maintenance modelling: a Lagrangian-based heuristic approach [J].
Alimian, Mahyar ;
Ghezavati, Vahidreza ;
Tavakkoli-Moghaddam, Reza ;
Ramezanian, Reza .
OPERATIONAL RESEARCH, 2024, 24 (02)
1234