Heuristic methods for the capacitated stochastic lot-sizing problem under the static-dynamic uncertainty strategy

Date

2019-09-01

Author

Randa, A. Cem
Dogru, Mustafa K.
İyigün, Cem
Ozen, Ulas

Metadata

Show full item record

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

Item Usage Stats

215
views

0
downloads

We consider a lot-sizing problem in a single-item single-stage production system facing non-stationary stochastic demand in a finite planning horizon. Motivated by common practice, the set-up times need to be determined and frozen once and for all at the beginning of the horizon while decisions on the exact lot sizes can be deferred until the setup epochs. This operating scheme is referred to as the static dynamic uncertainty strategy in the literature. It has been shown that a modified base stock policy is optimal for a capacitated system with minimum lot size restrictions under the static-dynamic uncertainty strategy. However, the optimal policy parameters require an exhaustive search, for which the computational time grows exponentially in the number of periods in the planning horizon. In order to alleviate the computational burden for real-life size problems, we developed and tested seven different heuristics for computational efficiency and solution quality. Our extensive numerical experiments showed that average optimality gaps less than 0.1% and maximum optimality gaps below 4% can be attained in reasonable running times by using a combination of these heuristics. (C) 2019 Published by Elsevier Ltd.

Subject Keywords

Management Science and Operations Research, Modelling and Simulation, General Computer Science

URI

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

Journal

COMPUTERS & OPERATIONS RESEARCH

DOI

https://doi.org/10.1016/j.cor.2019.03.007

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

Heuristic methods for the stochastic lot-sizing problem under the static-dynamic uncertainty strategy Randa, Ali Cem; İyigün, Cem; Department of Industrial Engineering (2013) We consider a lot-sizing problem in a single-item single-stage production system facing nonstationary stochastic demand in a finite planning horizon. Motivated by practice, the set-up times need to be determined and frozen once and for all at the beginning of the horizon while decision on the exact lot sizes can be deferred until the setup time. This operating scheme is referred to as the static-dynamic uncertainty strategy in the literature. For a capacitated system with minimum lot size restrictions, it h...
Assessing the benefits of remanufacturing option under one-way substitution and capacity constraint Bayındır, Zeynep Pelin; Gullu, Refik (Elsevier BV, 2007-02-01) In this article, we investigate the profitability of remanufacturing option when the manufactured and remanufactured products are segmented to different markets and the production capacity is finite. A single period profit model under substitution is constructed to investigate the system conditions under which remanufacturing is profitable. We present analytical findings and computational results to show profitability of remanufacturing option under substitution policy subject to a capacity constraint of th...
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.
Optimal lot-sizing/vehicle-dispatching policies under stochastic lead times and stepwise fixed costs Alp, O; Erkip, NK; Gullu, R (Institute for Operations Research and the Management Sciences (INFORMS), 2003-01-01) We characterize optimal policies of a dynamic lot-sizing/vehicle-dispatching problem under dynamic deterministic demands and stochastic lead times. An essential feature of the problem is the structure of the ordering cost, where a fixed cost is incurred every time a batch is initiated (or a vehicle is hired) regardless of the portion of the batch (or vehicle) utilized. Moreover, for every unit of demand not satisfied on time, holding and backorder costs are incurred. Under mild assumptions we show that the ...
Inventory control under substitutable demand: A stochastic game application Avşar, Zeynep Müge (Wiley, 2002-06-01) Substitutable product inventory problem is analyzed using the concepts of stochastic game theory. It is assumed that there are two substitutable products that are sold by different retailers and the demand for each product is random. Game theoretic nature of this problem is the result of substitution between products. Since retailers compete for the substitutable demand, ordering decision of each retailer depends on the ordering decision of the other retailer. Under the discounted payoff criterion, this pro...

Citation Formats

A. C. Randa, M. K. Dogru, C. İyigün, and U. Ozen, “Heuristic methods for the capacitated stochastic lot-sizing problem under the static-dynamic uncertainty strategy,” COMPUTERS & OPERATIONS RESEARCH, pp. 89–101, 2019, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/34338.