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

173
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

Suggestions

OpenMETU
Core

Beam search algorithm for capacity allocation problem in flexible manufacturing systems Ozpeynirci, Selin Bilgin; Azizoğlu, Meral (Elsevier BV, 2009-05-01) This study considers the operation assignment and tool allocation problem in flexible manufacturing systems. A set of operations together with their required tools are selected so as to maximize the total weight. The machines have limited time and tool magazine capacities and the tools are available in limited quantities. We develop a beam search algorithm and obtain near optimal solutions for large size problems very quickly.
Operation assignment and capacity allocation problem in automated manufacturing systems Bilgin, Selin; Azizoğlu, Meral (Elsevier BV, 2009-03-01) We address an operation assignment and capacity allocation problem that arises in semiconductor industries and flexible manufacturing systems. We assume the automated machines have scarce time and tool magazine capacities and the tools are available in limited quantities. The aim is to select a subset of operations with maximum total weight. We show that the problem is NP-hard in the strong sense, develop two heuristics and a Tabu Search procedure. The results of our computational tests have revealed that o...
Approximation of sell-out probability to estimate expected marginal value of capacity Selçuk, Ahmet Melih; Avşar, Zeynep Müge (Elsevier BV, 2020-01-01) © 2020 Elsevier LtdIn this study, the dynamic pricing problem is considered for single-leg airline revenue management. The dynamic programming formulation given for this problem is expressed in terms of the expected marginal revenue of capacity. In order to make the formulation applicable in practice, approximations are proposed in this study for estimating the expected marginal revenue term. Numerical tests based on simulating the sales process show that the proposed approximations work well as compared to...
Lithium-intercalation oxides for rechargeable batteries Ceder, Gerbrand; VanderVen, Anton; Aydınol, Mehmet Kadri (Springer Science and Business Media LLC, 1998-09-01) Since the introduction of the LixC/LiCoO2 cell, rechargeable lithium batteries have become the technology of choice for applications where volume or weight are a consideration (e.g., laptop computers and cell phones). The focus of current research in cathode-active materials is on less-expensive or higher-performance materials than LiCoO2. This article illustrates how first-principles calculations can play a critical role in obtaining the understanding needed to design improved cathode oxides.
Cyclic ordering policies from capacitated suppliers under limited cycle time EKİCİ, ALİ; Ozener, Okan Orsan; Duran, Serhan (Elsevier BV, 2019-02-01) In this paper, we study the ordering policy of a manufacturer/retailer which procures a single item from multiple capacitated suppliers and satisfies an exogenous deterministic and constant demand. Manufacturer's objective is to minimize total periodic ordering cost which has three components: (i) fixed ordering cost, (ii) variable purchasing cost, and (iii) inventory holding cost. We are interested in developing a cyclic ordering policy for the manufacturer where the orders are repeated with a certain freq...

Citation Formats

P. Bulbul, Z. P. Bayındır, and İ. S. Bakal, “Exact and heuristic approaches for joint maintenance and spare parts planning,” COMPUTERS & INDUSTRIAL ENGINEERING, pp. 239–250, 2019, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/36894.