An integrated cutting stock and lot sizing problem

Download

TEZ 20211005.pdf

Date

2021-9

Author

Şanan, Ayşe Burcu

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

280
views

182
downloads

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.

Subject Keywords

Two dimensional cutting stock problems, Lot sizing problems, Integrated problems, Multiobjective programming

URI

https://hdl.handle.net/11511/93196

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

A disassembly line balancing problem with fixed number of workstations Kalaycilar, Eda Goksoy; Azizoğlu, Meral; Yeralan, Sencer (2016-03-01) In this study, a Disassembly Line Balancing Problem with a fixed number of workstations is considered. The product to be disassembled comprises various components, which are referred to as its parts. There is a specified finite supply of the product to be disassembled and specified minimum release quantities (possible zero) for each part of the product. All units of the product are identical, however different parts can be released from different units of the product. There is a finite number of identical w...
A deterministic inventory/production model with general inventory cost rate function and piecewise linear concave production costs Bayındır, Zeynep Pelin; Frenk, J. B. G. (Elsevier BV, 2007-05-16) We present a thorough analysis of the economic production quantity model with shortages under a general inventory cost rate function and piecewise linear concave production costs. Consequently, an effective solution procedure, particularly useful for an approximation scheme, is proposed. A computational study is appended to illustrate the performance of the proposed solution procedure.
A branch and bound method for the line balancing problem in U-shaped assembly lines with equipment requirements Ogan, Dilek; Azizoğlu, Meral (2015-07-01) In this study we consider a U-shaped assembly line balancing problem where each task uses a specified set of equipments and each type of equipment has a specified cost. Our problem is to assign the tasks together with their equipments to the workstations so as to minimize the total equipment cost. We formulate the problem as a mixed integer linear programming model that is capable of solving small sized instances. We propose a branch and bound algorithm that uses efficient precedence relations and lower bou...
Effective network formulations for lot sizing with backlogging in two-level serial supply chains Solyali, Oguz; Denizel, Meltem; Süral, Haldun (2016-02-01) This study considers the serial lot sizing problem with backlogging in two-level supply chains to determine when and how much to order at a warehouse and ship to a retailer over a T-period planning horizon so that the external known demand occurring at the retailer is satisfied and the total cost at all levels is minimized. In particular, the uncapacitated two-level serial lot sizing problem with backlogging and the two-level serial lot sizing problem with cargo capacity and backlogging are formulated using...
Discrete sizing optimization of steel trusses under multiple displacement constraints and load cases using guided stochastic search technique Azad, S. Kazemzadeh; Hasançebi, Oğuzhan (2015-08-01) The guided stochastic search (GSS) is a computationally efficient design optimization technique, which is originally developed for discrete sizing optimization problems of steel trusses with a single displacement constraint under a single load case. The present study aims to investigate the GSS in a more general class of truss sizing optimization problems subject to multiple displacement constraints and load cases. To this end, enhancements of the GSS are proposed in the form of two alternative approaches t...

Citation Formats

A. B. Şanan, “An integrated cutting stock and lot sizing problem,” M.S. - Master of Science, Middle East Technical University, 2021.