You are not currently logged in.
Access JSTOR through your library or other institution:
A Dynamic Stochastic Stock-Cutting Problem
Elena V. Krichagina, Rodrigo Rubio, Michael I. Taksar and Lawrence M. Wein
Vol. 46, No. 5 (Sep. - Oct., 1998), pp. 690-701
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/223012
Page Count: 12
You can always find the topics here!Topics: Minimization of cost, Average total cost, Waste paper, Scheduling, Paper cutting, Control theory, Capital costs, Average cost, Workloads, Simulations
Were these topics helpful?See somethings inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
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.
Operations Research © 1998 INFORMS