Block replacement policy is a type of preventive replacement policies where the units are always replaced at failure or at a scheduled time periodically. Assuming the lifetimes of the units are uncertain variables, this paper studies the block replacement policy in an uncertain environment. To deal with the different constraints a decision maker may face, three different criterions are used to ...

In this study, a new warranty service strategy is proposed and analyzed. This strategy adds the renewing free-replacement warranty to a non-repairable product sold under the rebate warranty policy. According to the renewing free-replacement warranty, the seller (manufacturer) is responsible for replacing all failed product during the warranty period, and the warranty begins anew with each repla...

I n the past many decades, breakdown, maintenance and replacement issues of deteriorating machines and systems are extensively studied within the literature. A number of maintenance and replacement models, techniques and policies are created, documented and tested. However, of these models are comprised of some classes ∗M.Tech. Student, Department of Mechanical Engineering, Madhav Institute of ...

In this paper we study the moment generating function order and the new better than used in the moment generating function order (NBUmg) life distributions. A closure property of this order under an independent random sum is deduced, and stochastic comparisons among the block replacement policy, the age replacement policy, the complete repair policy, and the minimal repair policy of an NBUmg co...

A predictive-maintenance structure for a gradually deteriorating single-unit system (continuous time/continuous state) is presented in this paper. The proposed decision model enables optimal inspection and replacement decision in order to balance the cost engaged by failure and unavailability on an infinite horizon. Two maintenance decision variables are considered: the preventive replacement t...

Despite extensive developments in improving cache hit rates, designing an optimal replacement policy that mimics Belady’s algorithm still remains a challenging task. Existing standard static policies does not adapt to the dynamic nature of memory access patterns, and diversity computer programs only exacerbates problem. Several factors affect design such as hardware upgrades, overheads, model l...

The cache replacement policy is one of the factors that determines the eeectiveness of cache memories. In this paper, we study the impact of incorporating the cache block coherence state information in the Random replacement policy in a shared{memory multipro-cessor. We assign replacement priority to each cache block within a set based on its state. To reduce the probability of replacing a rece...

A flow cache is a fundamental building block for flowbased traffic processing. Its efficiency is critical for the overall performance of a number of networked devices and systems. The efficiency is mainly dependent on a utilized replacement policy. This work proposes an approach based on Genetic Algorithm. The proposed approach starts from recorded traffic traces and uses Genetic Algorithm to e...