A dynamic stochastic stock-cutting problem

A dynamic stochastic stock-cutting problem

0.00 Avg rating0 Votes
Article ID: iaor2000114
Country: United States
Volume: 46
Issue: 5
Start Page Number: 690
End Page Number: 701
Publication Date: Sep 1998
Journal: Operations Research
Authors: , , ,
Keywords: queues: applications, cutting stock
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.