IDEAS home Printed from https://ideas.repec.org/a/bla/popmgt/v31y2022i11p4154-4172.html
   My bibliography  Save this article

Robust stock assortment and cutting under defects in automotive glass production

Author

Listed:
  • Claudio Arbib
  • Fabrizio Marinelli
  • Mustafa Ç. Pınar
  • Andrea Pizzuti

Abstract

We address an assortment‐and‐cutting problem arising in the glass industry. The objective is to provide minimum waste solutions that are robust against such raw material imperfections as those possibly occurring with float glass production technology. The stochastic realization of defects is modeled as a spatial Poisson point process. A mixed integer program in the classical vein of robust optimization is presented and tested on data taken from a real plant application. Defective final products must in any case be discarded as waste but, if a recourse strategy is adopted, faults in glass sheets can sometimes be recovered. Closed forms for the computation of faulty item probabilities are provided in simple cases, and obtained via Monte Carlo simulation in more complex ones. The computational results demonstrate the benefits of the robust approach in terms of the reduction of back‐orders and overproduction, thereby showing that recourse strategies can enable nonnegligible improvements. Encouraged by this result, the management is presently evaluating the possibility of adopting the proposed model in plant operation.

Suggested Citation

  • Claudio Arbib & Fabrizio Marinelli & Mustafa Ç. Pınar & Andrea Pizzuti, 2022. "Robust stock assortment and cutting under defects in automotive glass production," Production and Operations Management, Production and Operations Management Society, vol. 31(11), pages 4154-4172, November.
  • Handle: RePEc:bla:popmgt:v:31:y:2022:i:11:p:4154-4172
    DOI: 10.1111/poms.13812
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/poms.13812
    Download Restriction: no

    File URL: https://libkey.io/10.1111/poms.13812?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Susan G. Hahn, 1968. "On the Optimal Cutting of Defective Sheets," Operations Research, INFORMS, vol. 16(6), pages 1100-1114, December.
    2. D. Sculli, 1981. "A Stochastic Cutting Stock Procedure: Cutting Rolls of Insulating Tape," Management Science, INFORMS, vol. 27(8), pages 946-952, August.
    3. Arbib, Claudio & Marinelli, Fabrizio, 2007. "An optimization model for trim loss minimization in an automotive glass plant," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1421-1432, December.
    4. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    5. Wascher, Gerhard & Hau[ss]ner, Heike & Schumann, Holger, 2007. "An improved typology of cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1109-1130, December.
    6. Douglas Alem & Pedro Munari & Marcos Arenales & Paulo Ferreira, 2010. "On the cutting stock problem under stochastic demand," Annals of Operations Research, Springer, vol. 179(1), pages 169-186, September.
    7. Ronny Aboudi & Paulo Barcia, 1998. "Determining cutting stock patternswhen defects are present," Annals of Operations Research, Springer, vol. 82(0), pages 343-354, August.
    8. C. Arbib & F. Marinelli, 2009. "Exact and Asymptotically Exact Solutions for a Class of Assortment Problems," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 13-25, February.
    9. Bahadır Durak & Dilek Tuzun Aksu, 2017. "Dynamic programming and mixed integer programming based algorithms for the online glass cutting problem with defects and production targets," International Journal of Production Research, Taylor & Francis Journals, vol. 55(24), pages 7398-7411, December.
    10. P. C. Gilmore & R. E. Gomory, 1961. "A Linear Programming Approach to the Cutting-Stock Problem," Operations Research, INFORMS, vol. 9(6), pages 849-859, December.
    11. Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2016. "Bin packing and cutting stock problems: Mathematical models and exact algorithms," European Journal of Operational Research, Elsevier, vol. 255(1), pages 1-20.
    12. Ronnqvist, Mikael & Astrand, Erik, 1998. "Integrated defect detection and optimization for cross cutting of wooden boards," European Journal of Operational Research, Elsevier, vol. 108(3), pages 490-508, August.
    13. Dimitris Bertsimas & David B. Brown, 2009. "Constructing Uncertainty Sets for Robust Linear Optimization," Operations Research, INFORMS, vol. 57(6), pages 1483-1495, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Celia Glass & Jeroen Oostrum, 2010. "Bun splitting: a practical cutting stock problem," Annals of Operations Research, Springer, vol. 179(1), pages 15-33, September.
    2. B. S. C. Campello & C. T. L. S. Ghidini & A. O. C. Ayres & W. A. Oliveira, 2022. "A residual recombination heuristic for one-dimensional cutting stock problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 194-220, April.
    3. Dell’Amico, Mauro & Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2019. "Mathematical models and decomposition methods for the multiple knapsack problem," European Journal of Operational Research, Elsevier, vol. 274(3), pages 886-899.
    4. Sierra-Paradinas, María & Soto-Sánchez, Óscar & Alonso-Ayuso, Antonio & Martín-Campo, F. Javier & Gallego, Micael, 2021. "An exact model for a slitting problem in the steel industry," European Journal of Operational Research, Elsevier, vol. 295(1), pages 336-347.
    5. Wuttke, David A. & Heese, H. Sebastian, 2018. "Two-dimensional cutting stock problem with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 265(1), pages 303-315.
    6. Kallrath, Julia & Rebennack, Steffen & Kallrath, Josef & Kusche, Rüdiger, 2014. "Solving real-world cutting stock-problems in the paper industry: Mathematical approaches, experience and challenges," European Journal of Operational Research, Elsevier, vol. 238(1), pages 374-389.
    7. Gonçalves, José Fernando & Wäscher, Gerhard, 2020. "A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects," European Journal of Operational Research, Elsevier, vol. 286(3), pages 867-882.
    8. Schepler, Xavier & Rossi, André & Gurevsky, Evgeny & Dolgui, Alexandre, 2022. "Solving robust bin-packing problems with a branch-and-price approach," European Journal of Operational Research, Elsevier, vol. 297(3), pages 831-843.
    9. Yulle G. F. Borges & Vinícius L. Lima & Flávio K. Miyazawa & Lehilton L. C. Pedrosa & Thiago A. Queiroz & Rafael C. S. Schouery, 2024. "Algorithms for the bin packing problem with scenarios," Journal of Combinatorial Optimization, Springer, vol. 48(4), pages 1-28, November.
    10. Vera Neidlein & Andrèa C. G. Vianna & Marcos N. Arenales & Gerhard Wäscher, 2008. "The Two-Dimensional, Rectangular, Guillotineable-Layout Cutting Problem with a Single Defect," FEMM Working Papers 08035, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    11. Silva, Eduardo M. & Melega, Gislaine M. & Akartunalı, Kerem & de Araujo, Silvio A., 2023. "Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost," European Journal of Operational Research, Elsevier, vol. 304(2), pages 443-460.
    12. Vasko, Francis J. & Newhart, Dennis D. & Stott, Kenneth Jr., 1999. "A hierarchical approach for one-dimensional cutting stock problems in the steel industry that maximizes yield and minimizes overgrading," European Journal of Operational Research, Elsevier, vol. 114(1), pages 72-82, April.
    13. John Martinovic & Guntram Scheithauer, 2018. "Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case," Annals of Operations Research, Springer, vol. 271(2), pages 811-829, December.
    14. Wang, Danni & Xiao, Fan & Zhou, Lei & Liang, Zhe, 2020. "Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation," European Journal of Operational Research, Elsevier, vol. 286(2), pages 547-563.
    15. Wenqing Chen & Melvyn Sim & Jie Sun & Chung-Piaw Teo, 2010. "From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization," Operations Research, INFORMS, vol. 58(2), pages 470-485, April.
    16. Jean-François Côté & Manuel Iori, 2018. "The Meet-in-the-Middle Principle for Cutting and Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 30(4), pages 646-661, November.
    17. Chassein, André & Dokka, Trivikram & Goerigk, Marc, 2019. "Algorithms and uncertainty sets for data-driven robust shortest path problems," European Journal of Operational Research, Elsevier, vol. 274(2), pages 671-686.
    18. Erjavec, J. & Gradisar, M. & Trkman, P., 2012. "Assessment of stock size to minimize cutting stock production costs," International Journal of Production Economics, Elsevier, vol. 135(1), pages 170-176.
    19. Parreño, F. & Alvarez-Valdes, R., 2021. "Mathematical models for a cutting problem in the glass manufacturing industry," Omega, Elsevier, vol. 103(C).
    20. François Clautiaux & Cláudio Alves & José Valério de Carvalho & Jürgen Rietz, 2011. "New Stabilization Procedures for the Cutting Stock Problem," INFORMS Journal on Computing, INFORMS, vol. 23(4), pages 530-545, November.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bla:popmgt:v:31:y:2022:i:11:p:4154-4172. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1937-5956 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.