Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Heuristic methods for the stochastic lot-sizing problem under the static-dynamic uncertainty strategy
Download
index.pdf
Date
2013
Author
Randa, Ali Cem
Metadata
Show full item record
Item Usage Stats
165
views
169
downloads
Cite This
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 has been shown that a modified base stock policy is optimal 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 develop and test seven diff erent heuristics for computational effi ciency and solution quality. Our extensive numerical experiments show that optimality gaps below 1% can be attained in reasonable running times by using a combination of these heuristics.
Subject Keywords
Economic lot size.
,
Materials management.
,
Stochastic analysis.
,
Heuristic algorithms.
,
Costs, Industrial.
URI
http://etd.lib.metu.edu.tr/upload/12616078/index.pdf
https://hdl.handle.net/11511/22698
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
Heuristic methods for the capacitated stochastic lot-sizing problem under the static-dynamic uncertainty strategy
Randa, A. Cem; Dogru, Mustafa K.; İyigün, Cem; Ozen, Ulas (Elsevier BV, 2019-09-01)
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...
Robust conditional value–at–risk under parallelpipe uncertainty: an application to portfolio optimization
Kara, Güray; Weber, Gerhard Wilhelm; Department of Financial Mathematics (2016)
In markets with high uncertainties, the trade–off between maximizing expected return and minimizing the risk is one of the main challenges in modeling and decision making. Since investors mostly shape their invested amounts towards certain assets and their risk version level according to their returns; scientists and practitioners has done studies on this subject since the beginning of the stock markets’ establishment. Developments and inventions in the mathematical optimization provide a wide range of solu...
Tactical inventory and backorder decisions for systems with predictable production yield
Mart, Turgut; Duran, Serhan; Department of Industrial Engineering (2010)
We consider a manufacturing system with stochastic demand and predictable production yield. The manufacturer has predetermined prices and limited production capacity in each period. The producer also has the option to save some inventory for future periods even if there is demand in the current period. The demand that is not met is lost or may be backordered for only one period. Our objective is to maximize the expected profit by choosing optimal production, save and backorder quantities in each period. We ...
A Stochastic Maximum Principle for a Markov Regime-Switching Jump-Diffusion Model with Delay and an Application to Finance
Savku, Emel; Weber, Gerhard Wilhelm (2018-11-01)
We study a stochastic optimal control problem for a delayed Markov regime-switching jump-diffusion model. We establish necessary and sufficient maximum principles under full and partial information for such a system. We prove the existence-uniqueness theorem for the adjoint equations, which are represented by an anticipated backward stochastic differential equation with jumps and regimes. We illustrate our results by a problem of optimal consumption problem from a cash flow with delay and regimes.
Tactical inventory and backorder decisions for systems with predictable production yield
MART, Turgut; Duran, Serhan; Bakal, İsmail Serdar (2013-06-01)
We consider a manufacturing system with stochastic demand and predictable production yield. The manufacturer has predetermined prices and limited production capacity in each period. The manufacturer also has the option to save some inventory for future periods even if there is demand in the current period. The demand that is not met is lost or may be backordered for only one period. Our objective is to maximize the expected profit by choosing optimal produce-up-to level ((Y) over bar*(t)), save (S*(t)) and ...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
A. C. Randa, “Heuristic methods for the stochastic lot-sizing problem under the static-dynamic uncertainty strategy,” M.S. - Master of Science, Middle East Technical University, 2013.