On discounted discrete scheduled replacement model
Author(s):
Article Type:
Research/Original Article (بدون رتبه معتبر)
Abstract:
An operating unit sometimes cannot be replaced at the exact optimum replacement time for some reasons. The unit may be rather replaced at idle times, such as a day, a week, a month, a year and so on. So to address such problem of replacing a unit at idle times, this paper come up with a discounted discrete scheduled replacement model for a unit. It is assumed that the replacement is at scheduled times NT(N=1,2,3,…) for a fixed T>0, such that the model constructed involves minimal repair and discounting rate (∝ >0). The unit considered in this paper is subjected to three categories of failures, which are Category I, Category II and Category III failures. Category I failure is an un-repairable one, which occurs suddenly. While Category II and Category III failures are both repairable, which occurs due to time and usage, and the two failures are minimally repaired. A numerical example is provided, so as to investigate the characteristics of the model presented and determine the optimal discrete replacement time (N^*) of the unit.
Keywords:
category , Discounted , Discrete , optimal , Repair
Language:
English
Published:
Annals of Optimization Theory and Practice, Volume:4 Issue: 2, Summer 2021
Pages:
69 to 82
magiran.com/p2315154
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یکساله به مبلغ 1,390,000ريال میتوانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
- حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران میشود.
- پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانههای چاپی و دیجیتال را به کاربر نمیدهد.
In order to view content subscription is required
Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!