Dynamic lot sizing with product returns and remanufacturing

Download
2006-10-15
Teunter, Ruud H.
Bayındır, Zeynep Pelin
Van Den Heuvel, Wilco
We address the dynamic lot sizing problem for systems with product returns. The demand and return amounts are deterministic over the finite planning horizon. Demands can be satisfied by manufactured new items, but also by remanufactured returned items. The objective is to determine those lot sizes for manufacturing and remanufacturing that minimize the total cost composed of holding cost for returns and (re) manufactured products and set-up costs. Two different set-up cost schemes are considered: there is either a joint set-up cost for manufacturing and remanufacturing (single production line) or separate set-up costs (dedicated production lines). For the joint set-up cost case, we present an exact, polynomial-time dynamic programming algorithm. For both cases, we suggest modi. cations of the well-known Silver Meal (SM), Least Unit Cost (LUC) and Part Period Balancing (PPB) heuristics. An extensive numerical study reveals a number of insights. The key ones are that, under both set-up cost schemes: (1) the SM and LUC heuristics perform much better than PPB, (2) increased variation in the demand amounts can lead to reduced cost, showing that predictability is more important than variation, and (3) periods with more returns than demand should, if possible, be avoided by 'matching' demand and return.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH

Suggestions

Low-frequency multilevel fast multipole algorithm using an approximate diagonalization of the Green's function
Ergül, Özgür Salih (2014-08-23)
We present an approximate diagonalization of the Green's function to implement a stable multilevel fast multipole algorithm (MLFMA) for low-frequency problems. The diagonalization is based on scaled spherical functions, leading to stable computations of translation operators at all distances and for all frequencies. Similar to the conventional diagonalization, shift operators are expressed in terms of complex exponentials, while radiated and incoming fields are expanded in terms of scaled plane waves. Even ...
A heuristic procedure for a single-item dynamic lot sizing problem
Benli., Ömer S; Sabuncuoğlu, İhsan; Tüfekçi, Süleyman (Elsevier BV, 1988-1)
An O(T) heuristic proceudre for a single-item dynamic lot sizing problem is introduced in this paper. The algorithm tries to establish the regeneration points of the problem whether either the production or the beginning inventory must be equal to zero. The proposed algorithm is very easy to implement and compares very favourably with the existing heuristic procedures.
A note on ''The general lot sizing and scheduling problem''
Koclar, A; Süral, Haldun (Springer Science and Business Media LLC, 2005-01-01)
Fleischmann and Meyr (1997) develop a model for the lot sizing problem with sequence dependent setup costs. In this note we show that this model is limited to the case where production state between two consecutive periods is conserved only if the available capacity of the preceding period exceeds the minimum batch quantity. We generalize the model by modification.
Evaluation of pushover analysis procedures for frame structure
Oğuz, Sermin; Yakut, Ahmet; Department of Civil Engineering (2005)
Pushover analysis involves certain approximations and simplifications that some amount of variation is always expected to exist in seismic demand prediction of pushover analysis. In literature, some improved pushover procedures have been proposed to overcome the certain limitations of traditional pushover procedures. The effects and the accuracy of invariant lateral load patterns utilised in pushover analysis to predict the behavior imposed on the structure due to randomly selected individual ground motions...
Dynamic Lead-Time Quotation for an M/M/1 Base-Stock Inventory Queue
Savaşaneril Tüfekci, Seçil; Keskinocak, Pinar (2010-03-01)
We study a dynamic lead-time quotation problem in a base-stock inventory system characterized by lead-time sensitive Poisson demand and exponentially distributed service times. We show that the optimal profit is unimodal in the base-stock level. We compare the base-stock system with a make-to-order (MTO) system and show that the lead-time quotes are lower in an MTO system and that increasing the base-stock level does not necessarily decrease the expected number of customers waiting. Numerical results show t...
Citation Formats
R. H. Teunter, Z. P. Bayındır, and W. Van Den Heuvel, “Dynamic lot sizing with product returns and remanufacturing,” INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, pp. 4377–4400, 2006, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/36934.