Single Product Disassembly Lot Sizing Problem with Disposal

Abstract

Disassembly scheduling is attracting a lot of attention in disassembly systems because of its role to reduce environmental impacts. A single product disassembly lot sizing problem with disposal (DLSPD) is addressed in this paper. Due to the existence of the yields (number of components obtained from disassembling one unit of product) and the demands between components that are not necessary well balanced, unnecessary surplus inventory can be generated during planning horizon. An integer programming model is developed to optimize the sum of setup, inventory holding, disassembly operation, and disposal costs, which allows taking decision to manage the surplus inventory problem. This paper focuses on the problem with no capacity restriction on disassembly resources and single product type with a two-level product structure. Finally, two heuristic solution methods have been proposed and their solutions and computational times are compared with those obtained from mathematical programming using CPLEX solver for different-sized instances. The heuristics are able to find very good solutions (optimal or near optimal) in a very short computational time.