One-dimensional cutting stock optimization in consecutive time periods

The paper deals with the general one-dimensional cutting stock problem (G1D-CSP), where optimization is not limited to a single order. Stock cutting is treated as a permanent business process in a company in which consecutive order sets need to be fulfilled either for production needs or for its customers. Exact demand for future orders is not known in advance. The unutilized and partly utilized stock lengths left after fulfilling current order sets are stored and used later. The goal is the reduction of trim loss and costs over a broader time-span. A new approach is suggested where previously developed method for G1D-CSP is modified. Several practical examples of the cutting process for several consecutive order sets are presented. An extension to a currently used typology for cutting stock problems is proposed.