Baskı endüstrisindeki problemler için küme-kaplama tabanlı sezgisel yaklaşımlar

In this thesis, we focus on two different planning production problems coming from the printing industry. The first problem is the label printing problem and the second one is a variant of the cover printing problem. In both studies, the problems take into account the best assignment of products on different templates in order to meet demand requirements. In the first part of the thesis, we focus on minimizing the waste, whereas the goal is to minimize the total production cost in the second problem. In these problems, each template can contain fixed number of products and suitable assignment of products to each template provides to decrease the waste of products and to improve the efficient of the printing production with minimum waste. We handle the first problem into two different cases. Each product can be assigned to a single template in the first case, whereas each product can be assigned to the all templates in the second case. In the second problem, we consider only second case due to the organizational constraints. We propose two-phase heuristic algorithms to solve these problems since the studied problems are hard. We conduct an extensive computational studies on real-world and randomly generated instances in order to assess the performances of the proposed algorithms and compare the performances of the proposed algorithms with respect to existing solution algorithms in the literature in terms of solution quality.