DSpace Repository

AN INTEGER LINEAR PROGRAMMING MODEL FOR THE THREE-DIMENSIONAL MARBLE CUTTING PROBLEM

Show simple item record

dc.creator Yilmaz, Gokhan
dc.creator ŞAHİN, YUSUF
dc.date 2023-03-01T00:00:00Z
dc.date.accessioned 2025-02-25T10:18:06Z
dc.date.available 2025-02-25T10:18:06Z
dc.identifier 1d36476d-2ed8-44c3-9129-40d60b14f305
dc.identifier 10.30798/makuiibf.1220059
dc.identifier https://avesis.sdu.edu.tr/publication/details/1d36476d-2ed8-44c3-9129-40d60b14f305/oai
dc.identifier.uri http://acikerisim.sdu.edu.tr/xmlui/handle/123456789/98977
dc.description The marble blocks extracted from the quarries in the form of cubes go through a number of cutting processes in the factories. Marble slabs are produced first by cutting these blocks. Then, marble tiles are obtained from these slabs, and the cutting process is completed. The cutting plan for each block is created according to the dimensions of the products demanded by the customers. Therefore, a different cutting plan is determined for each block. While creating the cutting plan, the focus is on obtaining the maximum product from marble blocks. In this study, an integer linear programming model that creates a cutting plan is proposed to maximize the utilization rate of marble blocks. This model was used in the production process of a real marble factory. As a result of the cutting plans created with the model, customer demands were met with a waste rate of 15.73%.
dc.language eng
dc.rights info:eu-repo/semantics/openAccess
dc.title AN INTEGER LINEAR PROGRAMMING MODEL FOR THE THREE-DIMENSIONAL MARBLE CUTTING PROBLEM
dc.type info:eu-repo/semantics/article


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account