Bütünleşik stok kesme ve parti büyüklüğü belirleme problemi

In this thesis, we consider an integrated two dimensional cutting stock and lot sizing problem arising in an aircraft manufacturing plant. The items are to be cut from steel panels of identical size to satisfy all periodic demands over a specified planning horizon. Two objectives, minimizing the number of panels cut and total inventory carrying cost of the items, are defined and all nondominated objective vectors with respect to the defined objectives are generated. To generate each nondominated objective vector, we propose a mixed integer linear programming model whose efficiency is improved by optimality properties and bounding mechanisms. We propose a decomposition-based heuristic algorithm to solve the instances having the smallest number of panels. The results of our experiments based on real data and data taken from the literature have revealed that the instances with few items can be solved for up to 14 periods and the instances with more items can be solved for up to 7 periods, within our termination limit of two hours.