Abstract
This chapter deals with a case study on deckle optimization problem encountered in paper and paperboard industries. The problem is crucial for the industry as it concerns huge financial implications. The decision making problems are too complex to handle manually and software solutions are indispensable. Deckle optimization problems are solved typically using the one-dimensional cutting stock problem and travelling salesmen problem models. Intelligent modeling is essential to solve the cutting stock problems arising in the context of deckle optimization. With a brief introduction to the products and processes relevant to this case study, the chapter presents various formulations to handle the challenges. Time and material costs are two conflicting components of the deckle optimization problem. The formulations proposed aid the user to explore the consequences of weighing these two conflicting factors while choosing the strategy for optimal decision making. The formulations and solutions are illustrated with examples and a practical instance of the problem picked up from the past data. A software solution has been developed for the client which uses excel as frontend as desired by the client.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Biermann, C.J.: Handbook of Pulping and Papermaking. Academic, San Diego (1993)
Bovet, D., Pierluigi, C.: Introduction to the Theory of Complexity. Prentice-Hall, New York (1994)
Farley, A.: Mathematical programming models for cutting stock problems in the clothing industry. J. Oper. Res. Soc. 39, 41–53 (1988)
Farley, A.: The cutting stock problem in the canvas industry. Eur. J. Oper. Res. 44, 247–255 (1990)
Gutin, G., Punnen, A.P.: The Traveling Salesman Problem and Its Variations. Springer, Heidelberg (2006)
Haessler, R.W.: A new generation of paper machine trim programs. TAPPI J. 71, 127–130 (1988)
Haessler, R.W., Sweeny, P.E.: Cutting stock problems and solution procedures. Eur. J. Oper. Res. 54, 141–150 (1991)
Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Dover, Mineola (1998)
Sweeney, P.E., Haessler, R.W.: One-dimensional cutting stock decisions for rolls with multiple quality grades. Eur. J. Oper. Res. 44, 224–231 (1990)
Sweeney, P.E., Paternoster, E.R.: Cutting and packing problems: a categorized, application-oriented research bibliography. J. Oper. Res. Soc. 43, 691–706 (1992)
Taha, H.A.: An Introduction to Operations Research. Prentice Hall, New Jersey (2007)
Volgenant, A., Jonker, R.: A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation. Eur. J. Oper. Res. 9, 83–89 (1982)
Volgenant, A., Jonker, R.: The symmetric traveling salesman problem and edge exchanges in minimal 1-trees. Eur. J. Oper. Res. 12, 394–403 (1983)
Acknowledgements
The author wishes to thank the client for providing the opportunity to work on this problem. This case study is a project undertaken by Aditya Gudimella as a part of the curriculum of the courses on Statistical Quality Control and Operations Research at the Indian Statistical Institute. With minimal guidance, he has been able to contribute significantly to this project. Two of his major contributions to this project are the formulation for minimizing the cutting patterns (5.6) and the development of the software solution.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Murthy, G.S.R. (2015). Deckle Optimization in Paper Industry. In: Applications of Operations Research and Management Science. International Series in Operations Research & Management Science, vol 229. Springer, Cham. https://doi.org/10.1007/978-3-319-17921-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-17921-6_5
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-17920-9
Online ISBN: 978-3-319-17921-6
eBook Packages: Business and EconomicsBusiness and Management (R0)