Abstract
Two important optimization problems occur in the planning and production scheduling in paper industries: the lot sizing problem and the cutting stock problem. The lot sizing problem must determine the quantity of jumbos of different types of paper to be produced in each machine over a finite planning horizon.These jumbos are then cut in order to meet the demand of items for each period. In this paper, we deal with the integration of these two problems, aiming to minimize costs of production and in- ventory of jumbos, as well as the trim loss of paper generated during the cutting process. Two mathematical models for the integrated problem are considered, and these models are solved both heuristically and using an optimization package. Attempting to get lower bounds for the problem, relaxed versions of the models also have been solved. Finally, computational experiments are presented and discussed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.