IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v287y2020i1p378-388.html
   My bibliography  Save this article

Solving a large cutting problem in the glass manufacturing industry

Author

Listed:
  • Parreño, F.
  • Alonso, M.T.
  • Alvarez-Valdes, R.

Abstract

The glass cutting problem proposed by Saint Gobain for the 2018 ROADEF challenge includes some specific constraints that prevent the direct application of procedures developed for the standard cutting problem. On the one hand, the sheets to be cut have defects that make them unique and they must be used in a given order. On the other hand, pieces are grouped in stacks and the pieces in each stack must be cut in order. There are also some additional characteristics due to the technology being used, especially the requirement for a three-stage guillotine cutting process.

Suggested Citation

  • Parreño, F. & Alonso, M.T. & Alvarez-Valdes, R., 2020. "Solving a large cutting problem in the glass manufacturing industry," European Journal of Operational Research, Elsevier, vol. 287(1), pages 378-388.
    • Handle: RePEc:eee:ejores:v:287:y:2020:i:1:p:378-388
    DOI: 10.1016/j.ejor.2020.05.016
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221720304446
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2020.05.016?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Silva, Elsa & Alvelos, Filipe & Valério de Carvalho, J.M., 2010. "An integer programming model for two- and three-stage two-dimensional cutting stock problems," European Journal of Operational Research, Elsevier, vol. 205(3), pages 699-708, September.
    2. Kress, Dominik & Dornseifer, Jan & Jaehn, Florian, 2019. "An exact solution approach for scheduling cooperative gantry cranes," European Journal of Operational Research, Elsevier, vol. 273(1), pages 82-101.
    3. Bennell, J.A. & Cabo, M. & Martínez-Sykora, A., 2018. "A beam search approach to solve the convex irregular bin packing problem with guillotine guts," European Journal of Operational Research, Elsevier, vol. 270(1), pages 89-102.
    4. Mhand Hifi & Catherine Roucairol, 2001. "Approximate and Exact Algorithms for Constrained (Un) Weighted Two-dimensional Two-staged Cutting Stock Problems," Journal of Combinatorial Optimization, Springer, vol. 5(4), pages 465-494, December.
    5. Borba, Leonardo & Ritt, Marcus & Miralles, Cristóbal, 2018. "Exact and heuristic methods for solving the Robotic Assembly Line Balancing Problem," European Journal of Operational Research, Elsevier, vol. 270(1), pages 146-156.
    6. Ronny Aboudi & Paulo Barcia, 1998. "Determining cutting stock patternswhen defects are present," Annals of Operations Research, Springer, vol. 82(0), pages 343-354, August.
    7. Sabuncuoglu, I. & Bayiz, M., 1999. "Job shop scheduling with beam search," European Journal of Operational Research, Elsevier, vol. 118(2), pages 390-412, October.
    8. Mauro Baldi & Teodor Crainic & Guido Perboli & Roberto Tadei, 2014. "Branch-and-price and beam search algorithms for the Variable Cost and Size Bin Packing Problem with optional items," Annals of Operations Research, Springer, vol. 222(1), pages 125-141, November.
    9. Ghirardi, M. & Potts, C. N., 2005. "Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach," European Journal of Operational Research, Elsevier, vol. 165(2), pages 457-467, September.
    10. Martinez-Sykora, A. & Alvarez-Valdes, R. & Bennell, J.A. & Ruiz, R. & Tamarit, J.M., 2017. "Matheuristics for the irregular bin packing problem with free rotations," European Journal of Operational Research, Elsevier, vol. 258(2), pages 440-455.
    11. X Song & J A Bennell, 2014. "Column generation and sequential heuristic procedure for solving an irregular shape cutting stock problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 65(7), pages 1037-1052, July.
    12. Polyakovskiy, Sergey & M’Hallah, Rym, 2018. "A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates," European Journal of Operational Research, Elsevier, vol. 266(3), pages 819-839.
    13. Guntram Scheithauer, 2018. "Introduction to Cutting and Packing Optimization," International Series in Operations Research and Management Science, Springer, number 978-3-319-64403-5, December.
    14. Bennell, Julia A. & Soon Lee, Lai & Potts, Chris N., 2013. "A genetic algorithm for two-dimensional bin packing with due dates," International Journal of Production Economics, Elsevier, vol. 145(2), pages 547-560.
    15. Puchinger, Jakob & Raidl, Gunther R., 2007. "Models and algorithms for three-stage two-dimensional bin packing," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1304-1327, December.
    16. Silvano Martello & Daniele Vigo, 1998. "Exact Solution of the Two-Dimensional Finite Bin Packing Problem," Management Science, INFORMS, vol. 44(3), pages 388-399, March.
    17. P. C. Gilmore & R. E. Gomory, 1965. "Multistage Cutting Stock Problems of Two and More Dimensions," Operations Research, INFORMS, vol. 13(1), pages 94-120, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Parreño, F. & Alvarez-Valdes, R., 2021. "Mathematical models for a cutting problem in the glass manufacturing industry," Omega, Elsevier, vol. 103(C).
    2. Polyakovskiy, Sergey & M’Hallah, Rym, 2022. "A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem," European Journal of Operational Research, Elsevier, vol. 299(1), pages 104-117.
    3. Braam, Florian & van den Berg, Daan, 2022. "Which rectangle sets have perfect packings?," Operations Research Perspectives, Elsevier, vol. 9(C).
    4. MA, Yunfeng & CHEN, Haoxun & YU, Yugang, 2022. "An efficient heuristic for minimizing the number of moves for the retrieval of a single item in a puzzle-based storage system with multiple escorts," European Journal of Operational Research, Elsevier, vol. 301(1), pages 51-66.
    5. Parreño-Torres, Consuelo & Alvarez-Valdes, Ramon & Parreño, Francisco, 2022. "A beam search algorithm for minimizing crane times in premarshalling problems," European Journal of Operational Research, Elsevier, vol. 302(3), pages 1063-1078.

    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. Parreño, F. & Alvarez-Valdes, R., 2021. "Mathematical models for a cutting problem in the glass manufacturing industry," Omega, Elsevier, vol. 103(C).
    2. Bennell, J.A. & Cabo, M. & Martínez-Sykora, A., 2018. "A beam search approach to solve the convex irregular bin packing problem with guillotine guts," European Journal of Operational Research, Elsevier, vol. 270(1), pages 89-102.
    3. Mateus Martin & Horacio Hideki Yanasse & Maristela O. Santos & Reinaldo Morabito, 2024. "Models for two-dimensional bin packing problems with customer order spread," Journal of Combinatorial Optimization, Springer, vol. 48(1), pages 1-27, August.
    4. François Clautiaux & Ruslan Sadykov & François Vanderbeck & Quentin Viaud, 2019. "Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 7(3), pages 265-297, September.
    5. Fabio Furini & Enrico Malaguti & Dimitri Thomopulos, 2016. "Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 736-751, November.
    6. Silva, Elsa & Oliveira, José Fernando & Silveira, Tiago & Mundim, Leandro & Carravilla, Maria Antónia, 2023. "The Floating-Cuts model: a general and flexible mixed-integer programming model for non-guillotine and guillotine rectangular cutting problems," Omega, Elsevier, vol. 114(C).
    7. Iori, Manuel & de Lima, Vinícius L. & Martello, Silvano & Miyazawa, Flávio K. & Monaci, Michele, 2021. "Exact solution techniques for two-dimensional cutting and packing," European Journal of Operational Research, Elsevier, vol. 289(2), pages 399-415.
    8. Hadj Salem, Khadija & Silva, Elsa & Oliveira, José Fernando & Carravilla, Maria Antónia, 2023. "Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry," European Journal of Operational Research, Elsevier, vol. 306(2), pages 549-566.
    9. Cui, Yaodong & Huang, Baixiong, 2012. "Reducing the number of cuts in generating three-staged cutting patterns," European Journal of Operational Research, Elsevier, vol. 218(2), pages 358-365.
    10. Leao, Aline A.S. & Toledo, Franklina M.B. & Oliveira, José Fernando & Carravilla, Maria Antónia & Alvarez-Valdés, Ramón, 2020. "Irregular packing problems: A review of mathematical models," European Journal of Operational Research, Elsevier, vol. 282(3), pages 803-822.
    11. Silva, Elsa & Alvelos, Filipe & Valério de Carvalho, J.M., 2010. "An integer programming model for two- and three-stage two-dimensional cutting stock problems," European Journal of Operational Research, Elsevier, vol. 205(3), pages 699-708, September.
    12. Jianyu Long & Zhong Zheng & Xiaoqiang Gao & Panos M. Pardalos & Wanzhe Hu, 2020. "An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem," Annals of Operations Research, Springer, vol. 289(2), pages 291-311, June.
    13. 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.
    14. Gregory S. Taylor & Yupo Chan & Ghulam Rasool, 2017. "A three-dimensional bin-packing model: exact multicriteria solution and computational complexity," Annals of Operations Research, Springer, vol. 251(1), pages 397-427, April.
    15. Melega, Gislaine Mara & de Araujo, Silvio Alexandre & Jans, Raf, 2018. "Classification and literature review of integrated lot-sizing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 1-19.
    16. Mhand Hifi & Rym M'Hallah, 2005. "An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems," Operations Research, INFORMS, vol. 53(1), pages 140-150, February.
    17. Lodi, Andrea & Martello, Silvano & Monaci, Michele, 2002. "Two-dimensional packing problems: A survey," European Journal of Operational Research, Elsevier, vol. 141(2), pages 241-252, September.
    18. Erenay, Fatih Safa & Sabuncuoglu, Ihsan & Toptal, Aysegül & Tiwari, Manoj Kumar, 2010. "New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs," European Journal of Operational Research, Elsevier, vol. 201(1), pages 89-98, February.
    19. Celia Glass & Jeroen Oostrum, 2010. "Bun splitting: a practical cutting stock problem," Annals of Operations Research, Springer, vol. 179(1), pages 15-33, September.
    20. Mhand Hifi & Toufik Saadi, 2012. "A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems," Computational Optimization and Applications, Springer, vol. 51(2), pages 783-807, March.

    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:eee:ejores:v:287:y:2020:i:1:p:378-388. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.