Name
Abstract | ||
|---|---|---|
The cutting stock problem (CSP) is one of the most fascinating problems in operations research. The problem aims at determining the optimal plan to cut a number of parts of various length from an inventory of standard-size material so to satisfy the customers demands. The deterministic CSP ignores the uncertain nature of the demands thus typically providing recommendations that may result in overproduction or in profit loss. This paper proposes a stochastic version of the CSP which explicitly takes into account uncertainty. Using a scenario-based approach, we develop a two-stage stochastic programming formulation. The highly non-convex nature of the model together with its huge size prevent the application of standard software. We use a solution approach designed to exploit the specific problem structure. Encouraging preliminary computational results are provided. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.ejor.2008.04.042 | European Journal of Operational Research |
Keywords | Field | DocType |
Stochastic programming,Trim-loss problem,Branch and bound | Branch and bound,Mathematical optimization,Benefice,Trim,Exploit,Software,Cutting stock problem,Stochastic programming,Convex analysis,Mathematics,Operations management | Journal |
Volume | Issue | ISSN |
197 | 1 | 0377-2217 |
Citations | PageRank | References |
5 | 0.47 | 24 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| P. Beraldi | 1 | 334 | 27.07 |
| Maria Elena Bruni | 2 | 139 | 12.15 |
| D. Conforti | 3 | 182 | 19.08 |