559
Views
15
CrossRef citations to date
0
Altmetric
Articles

The constrained two-dimensional guillotine cutting problem with defects: an ILP formulation, a Benders decomposition and a CP-based algorithm

ORCID Icon, ORCID Icon, ORCID Icon & ORCID Icon
Pages 2712-2729 | Received 19 Oct 2018, Accepted 04 Jun 2019, Published online: 20 Jun 2019

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (5)

Hao Zhang, Shaowen Yao, Qiang Liu, Lijun Wei, Libin Lin & Jiewu Leng. (2023) An exact approach for the constrained two-dimensional guillotine cutting problem with defects. International Journal of Production Research 61:9, pages 2986-3003.
Read now
Mateus Martin, Horacio Hideki Yanasse, Maristela O. Santos & Reinaldo Morabito. (2023) Models for two- and three-stage two-dimensional cutting stock problems with a limited number of open stacks. International Journal of Production Research 61:9, pages 2895-2916.
Read now
Mateus Martin, Reinaldo Morabito & Pedro Munari. (2022) Two-stage and one-group two-dimensional guillotine cutting problems with defects: a CP-based algorithm and ILP formulations. International Journal of Production Research 60:6, pages 1854-1873.
Read now
Felipe Kesrouani Lemos, Adriana Cristina Cherri & Silvio Alexandre de Araujo. (2021) The cutting stock problem with multiple manufacturing modes applied to a construction industry. International Journal of Production Research 59:4, pages 1088-1106.
Read now
Shaowen Yao, Hao Zhang, Qiang Liu, Jiewu Leng & Lijun Wei. Combinatorial Benders' decomposition for the constrained two-dimensional non-guillotine cutting problem with defects. International Journal of Production Research 0:0, pages 1-27.
Read now

Articles from other publishers (10)

Qiang Luo, Yunqing Rao & Bing Du. (2024) An effective discrete artificial bee colony for the rectangular cutting problem with guillotine in transformer manufacturing. Applied Soft Computing 159, pages 111617.
Crossref
Hao Zhang, Shaowen Yao, Qiang Liu, Jiewu Leng & Lijun Wei. (2023) Exact approaches for the unconstrained two-dimensional cutting problem with defects. Computers & Operations Research 160, pages 106407.
Crossref
Douglas Nogueira Nascimento, Adriana Cristina Cherri, José Fernando Oliveira & Beatriz Brito Oliveira. (2023) The two-dimensional cutting stock problem with usable leftovers and uncertainty in demand. Computers & Industrial Engineering 186, pages 109705.
Crossref
Mohsen Afsharian. (2023) A supply chain waste reduction optimization model using beam search algorithms for two-dimensional cutting problems with defects. Supply Chain Analytics 2, pages 100006.
Crossref
Douglas Nogueira do Nascimento, Adriana Cristina Cherri & José Fernando Oliveira. (2022) The two-dimensional cutting stock problem with usable leftovers: mathematical modelling and heuristic approaches. Operational Research 22:5, pages 5363-5403.
Crossref
Mustafa Küçük & Seyda Topaloglu Yildiz. (2022) Constraint programming-based solution approaches for three-dimensional loading capacitated vehicle routing problems. Computers & Industrial Engineering 171, pages 108505.
Crossref
Burcu Caglar Gencosman & Mehmet A. Begen. (2022) Exact optimization and decomposition approaches for shelf space allocation. European Journal of Operational Research 299:2, pages 432-447.
Crossref
F. Parreño & R. Alvarez-Valdes. (2021) Mathematical models for a cutting problem in the glass manufacturing industry. Omega 103, pages 102432.
Crossref
Luc Libralesso & Florian Fontan. (2021) An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem. European Journal of Operational Research 291:3, pages 883-893.
Crossref
Nicolás Acevedo, Carlos Rey, Carlos Contreras-Bolton & Victor Parada. (2020) Automatic design of specialized algorithms for the binary knapsack problem. Expert Systems with Applications 141, pages 112908.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.