A dynamic stochastic stock-cutting problem

被引:22
|
作者
Krichagina, EV [1 ]
Rubio, R
Taksar, MI
Wein, LM
机构
[1] Inst Control Sci, Moscow, Russia
[2] McKinsey & Co, Mexico City, DF, Mexico
[3] SUNY Stony Brook, Stony Brook, NY 11794 USA
[4] MIT, Boston, MA USA
关键词
D O I
10.1287/opre.46.5.690
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
We consider a stock cutting problem for a paper plant that produces sheets of various sizes for a finished goods inventory that services random customer demand. The controller decides when to shut down and restart the paper machine and how to cut completed paper rolls into sheets of paper. The objective is to minimize long-run expected average costs related to paper waste (from inefficient cutting), shutdowns, backordering, and holding finished goods inventory. A two-step procedure (linear programming in the first step and Brownian control in the second step) is developed that leads to an effective, but suboptimal, solution. The linear program greatly restricts the number of cutting configurations that can be employed in the Brownian analysis, and hence the proposed policy is easy to implement, and the resulting production process is considerably simplified. In an illustrative numerical example using representative data from an industrial facility, the proposed policy outperforms several policies that use a larger number of cutting configurations. Finally, we discuss some alternative production settings where this two-step procedure may be applicable.
引用
收藏
页码:690 / 701
页数:12
相关论文
共 50 条
  • [1] On the generalised stock-cutting problem
    Georgis, N
    Petrou, M
    Kittler, J
    MACHINE VISION AND APPLICATIONS, 2000, 11 (05) : 231 - 241
  • [2] A new placement heuristic for the orthogonal stock-cutting problem
    Burke, EK
    Kendall, G
    Whitwell, G
    OPERATIONS RESEARCH, 2004, 52 (04) : 655 - 671
  • [3] A GENERALIZED APPROACH TO THE SOLUTION OF ONE-DIMENSIONAL STOCK-CUTTING PROBLEM FOR SMALL SHIPYARDS
    Dikili, Ahmet Cemil
    Barlas, Baris
    JOURNAL OF MARINE SCIENCE AND TECHNOLOGY-TAIWAN, 2011, 19 (04): : 368 - 376
  • [4] A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem
    Burke, Edmund K.
    Kendall, Graham
    Whitwell, Glenn
    INFORMS JOURNAL ON COMPUTING, 2009, 21 (03) : 505 - 516
  • [5] On the cutting stock problem under stochastic demand
    Douglas José Alem
    Pedro Augusto  Munari
    Marcos Nereu Arenales
    Paulo Augusto Valente Ferreira
    Annals of Operations Research, 2010, 179 : 169 - 186
  • [6] On the cutting stock problem under stochastic demand
    Alem, Douglas Jose, Jr.
    Munari, Pedro Augusto, Jr.
    Arenales, Marcos Nereu
    Valente Ferreira, Paulo Augusto
    ANNALS OF OPERATIONS RESEARCH, 2010, 179 (01) : 169 - 186
  • [7] Optimal Stock Sizing in a Cutting Stock Problem with Stochastic Demands
    Zanarini, Alessandro
    INTEGRATION OF AI AND OR TECHNIQUES IN CONSTRAINT PROGRAMMING, CPAIOR 2017, 2017, 10335 : 293 - 301
  • [8] A reinforcement learning approach to the stochastic cutting stock problem
    Pitombeira-Neto, Anselmo R.
    Murta, Arthur H. F.
    EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION, 2022, 10
  • [9] Extending the Cutting Stock Problem for Consolidating Services with Stochastic Workloads
    Haehnel, Markus
    Martinovic, John
    Scheithauer, Guntram
    Fischer, Andreas
    Schill, Alexander
    Dargie, Waltenegus
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2018, 29 (11) : 2478 - 2488
  • [10] A CUTTING-STOCK PROBLEM WITH MULTIPLE OBJECTIVES AND STOCHASTIC DEMAND
    HUGHES, JB
    PARRYEVANS, AJ
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1986, 37 (12) : 1190 - 1190