Three Dimensional Cutting Problem: An Integer Programming Approach
AbstractCutting problem is one of the major problems faced in marble factories. Huge marble blocks coming from marble quarries are first cut into planes according to their depths. Then these planes are sized according to the length and width of the demanded products. In this study, cutting problem of a marble factory is handled. The two problems, which are cutting marble blocks into planes and sizing these planes, are integrated together. An integer programming model is built for the integrated problem. The objective of the model is to minimize total waste of marble while finding the cutting design of the marble block and marble planes. The model is used to solve the cutting problem of a real life marble processing factory. It is shown that the mathematical model decreases wasted amount of marble considerably compared to the industry average.
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Kahraman, B. Three Dimensional Cutting Problem: An Integer Programming Approach. Math. Comput. Appl. 2011, 16, 105-112.
Kahraman B. Three Dimensional Cutting Problem: An Integer Programming Approach. Mathematical and Computational Applications. 2011; 16(1):105-112.Chicago/Turabian Style
Kahraman, Bayram. 2011. "Three Dimensional Cutting Problem: An Integer Programming Approach." Math. Comput. Appl. 16, no. 1: 105-112.