ITM Web Conf.
Volume 36, 2021The 16th IMT-GT International Conference on Mathematics, Statistics and their Applications (ICMSA 2020)
|Number of page(s)
|Operations Research/Applied Mathematics
|26 January 2021
A model of a production-repair inventory system with time-varying demand and quality-dependent recovery channels
Centre for Mathematical Sciences, Universiti Tunku Abdul Rahman, Malaysia
* Corresponding author: email@example.com
In this paper, we study an inventory system over an infinite planning horizon where a time-varying demand is satisfied by process cycles that consist of a production batch followed by a recovery batch. Our model considers three types of inventory—returned items, serviceable items, and raw material. Furthermore, our model considers two recovery channels—recovery into serviceable items and recovery into raw material. Serviceable items are thus sourced from two inputs—direct recovery and production from raw material. These raw materials can be salvaged from returned items, as well as bought from external sources whenever required. We propose an expression for the unit time total cost as well as a numerical method to find the optimal policy. The properties of the model are studied through numerical experiments, in particular, the feasible situations where hybrid policies are better than pure policies.
© The Authors, published by EDP Sciences, 2021
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.