A heuristic approach for profit oriented disassembly lot-sizing problem

Kaya, Melike
In this thesis, we work on adisassembly lot-sizing problem for multiple products with parts commonality,i.e., general product structure. We assume that supply of discarded products is infinite. When a product (or a subassembly) is disassembled, all its immediate child items are obtained,i.e., complete disassembly case.Intermediate and leaf items obtained are demandedbyexternal suppliers or remanufacturers. The maximum possible salesfor each intermediate and leaf item are known.Sales of the intermediate and leaf items are the revenue sources. The discarded products are purchased ata unit purchasing cost. The disassembly operation incurs a fixed and a variable disassembly cost. Due to this cost structure, intermediate and leaf items can be stocked incurring an inventory holding cost. We develop an integer programming formulation to determine the time and quantity of the discarded products to be purchased;thetime and quantity of the discarded products and the intermediateitemsto be disassembled; and the time and quantity of intermediate and leaf items to be soldin order tomaximizethe total profit over a finite planning horizon. We state that ourproblem is NP-hard by refering the study of Kim et. al. (2009). We propose a heuristic solution approach that solves the problem in a reasonable computational time and generates near optimal solutions. The solution approach is based on the idea of sequentially solving a relaxed version of the problem and one-period integer programming models.In a computational study, the performance of the heuristic approach is assessed for a number ofrandomly generated problem instances.The results of the computational study show that the solutions of the heuristic approacharevery close to the optimal and the best feasible solutions obtained within the time limit.


Disassembly line balancing problem with fixed number of workstations and finite supply
Göksoy, Eda; Azizoğlu, Meral; Department of Industrial Engineering (2010)
In this thesis, we consider a Disassembly Line Balancing Problem (DLBP) with fixed number of workstations. We aim to maximize the total value of the recovered parts. We assume that there is a limited supply for the products to be disassembled. Different components can be obtained by disassembling different units of the product. Our aim is to assign the tasks to the workstations of the disassembly line so as to maximize the total value of the recovered parts. We present several upper and one lower bounding p...
Integration of supplier process : supplier segmentation, supplier selection and order allocation in a case company
Özalp, Yeşim; Köksal, Gülser; Department of Industrial Engineering (2005)
This thesis attempts to integrate the three supplier processes- supplier segmentation, supplier selection/evaluation and order allocation- based on a case study of a white goods manufacturer. These processes are dealt with in a hierarchical manner, where the decisions at an earlier stage (supplier segmentation) may affect on the results of later stages (supplier selection/evaluation and order allocation). Based on a wide set of variables gathered from the supplier segmentation literature and from the framew...
A probabilistic approach to multi criteria sorting problem
Buğdacı, Aslı Gül; Köksalan, Murat; Department of Industrial Engineering (2009)
We aim to classify alternatives evaluated in multiple criteria among preference ordered classes assuming an underlying additive utility function. We develop a probabilistic classification method by calculating the probability of an alternative being in each class. We assign alternatives to classes based on threshold probabilities. We require the decision maker to place an alternative to a class when no alternatives satisfy the required thresholds. We find new probabilities for unassigned alternatives in the...
Analysis of a deterministic demand production/inventory system under nonstationary supply uncertainty
Gullu, R; Onol, E; Erkip, N (Informa UK Limited, 1997-08-01)
In this article we investigate a periodic review inventory model under deterministic dynamic demand and supply unavailability. In a given period, supply is either available or completely unavailable with given probabilities. Supply unavailability probabilities are nonstationary over time. We show the optimality of an order-up-to level policy, and obtain a newsboy-like formula that determines the optimal order-up-to levels. Our formula would provide guidence as to the appropriate amount of inventory to stock...
Periodic-review inventory systems with exogenous and endogenous replenishment lead times
Aşcı, Murtaza; Avşar, Zeynep Müge; Department of Industrial Engineering (2007)
In this thesis, two-echelon systems with exogenous and endogenous lead times are studied for the orders placed by the retailer(s) from the supplier. The retailer(s) employ periodic-review base-stock policy, namely (R,S) policy. For the case the demand during review period is i.i.d. and the probability distribution is Normal for each review period, a new method is proposed for exogenous lead time case under stationary policy. The results of the proposed method is then compared with the results of the existin...
Citation Formats
M. Kaya, “A heuristic approach for profit oriented disassembly lot-sizing problem,” M.S. - Master of Science, Middle East Technical University, 2011.