Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Frequently Asked Questions
Frequently Asked Questions
Browse
Browse
By Issue Date
By Issue Date
Authors
Authors
Titles
Titles
Subjects
Subjects
Communities & Collections
Communities & Collections
Exact and heuristic approaches for joint maintenance and spare parts planning
Date
2019-03-01
Author
Bulbul, Pinar
Bayındır, Zeynep Pelin
Bakal, İsmail Serdar
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
5
views
0
downloads
In this study, we consider the joint problem of preventive replacement and spare parts inventory planning. We present an exact dynamic programming formulation to minimize the total expected cost over a finite planning horizon. As it is not possible to represent the optimal solution by a well-defined and practical policy, and the dynamic programming recursion is time-consuming to apply, we propose three heuristic approaches that are easy to understand and to implement in practice: (i) Steady-State Approximation, (ii) Stationary Policy and (iii) Myopic Approach. Through computational analyses, we investigate the effects of the model parameters on the performances of the proposed heuristics.
Subject Keywords
General Engineering
,
General Computer Science
URI
https://hdl.handle.net/11511/36894
Journal
COMPUTERS & INDUSTRIAL ENGINEERING
DOI
https://doi.org/10.1016/j.cie.2019.01.032
Collections
Department of Industrial Engineering, Article