Skip to Main Content
Skip Nav Destination
ASME Press Select Proceedings

International Conference on Computer and Automation Engineering, 4th (ICCAE 2012)

By
Jianhong Zhou
Jianhong Zhou
Search for other works by this author on:
ISBN:
9780791859940
No. of Pages:
460
Publisher:
ASME Press
Publication date:
2012

The main objective of any cutting stock optimization is to meet the demand (orders) and to find the cutting plan with the lowest trim loss at a given time. When the cutting stock optimization is viewed as continuous activity, which involves more than one order, the trim loss can be further reduced by returning specific leftovers back to stock and reusing them in subsequent orders. These problems are known as cutting stock problems with usable leftovers (CSPUL) and are found in various industries, inter alia in the field of nanotechnology where matter on atomic, molecular and cellular scale is manipulated. We distinguish two types of leftovers. If their size is lower than an arbitrarily set length T, they are treated as trim loss and are discarded. Leftovers above T are returned to stock. Following this definition, a heuristic method is proposed, which adjusts each specific cutting plan so as to generate more leftovers longer than T and consequently less trim loss. This method is tested by making cutting plans for two orders. The results are presented and they are close to 50% better if leftovers are intentionally generated.

Abstract
Key Words
1. Introduction
2. Solution Presentation
3. Conclusion
References
This content is only available via PDF.
You do not currently have access to this chapter.
Close Modal

or Create an Account

Close Modal
Close Modal