نتایج جستجو برای: degraded repairable system warranty minimal repairoverhaulreplacement sequential optimal decision dynamic programming

تعداد نتایج: 3355460  

2009
A. Eshraghnia Jahromi H. Vahdani

In this paper, a replacement-repair model is developed to study a warranty servicing policy for a class of multi-state deteriorating and repairable products, based on a computer simulation analysis. In each working state there is a determined probability for transition to each of the subsequent states, given that it has made a transition out of that state. There are two parameters that determin...

2001
Kai Virtanen Tuomas Raivio Raimo P. Hämäläinen

The paper presents an approach toward the off-line computation of preference optimal flight paths against given air combat maneuvers. The approach consists of a multistage influence diagram modeling the pilot’s sequential maneuvering decisions and a solution procedure that utilizes nonlinear programming. The influence diagram graphically describes the elements of the decision process, contains ...

Journal: :European Journal of Operational Research 2023

This study investigates the issue of optimal preventive replacement scheduling for a repairable system, considering its failure/repair history and environment or degradation, as characterised by covariates. The proposed approach is developed within recurrent event modelling framework, in which failure behaviour system defined intensity, perfect replacements imperfect corrective repairs are inte...

Journal: :CoRR 2017
Jiaxun Lu Shuo Wan Xuhong Chen Zhengchuan Chen Pingyi Fan Khaled Ben Letaief

This work considers the placement of unmanned aerial vehicle base stations (UAV-BSs) with criterion of minimum UAV-recall-frequency (UAV-RF), indicating the energy efficiency of mobile UAVs networks. Several different power consumptions, including signal transmit power, on-board circuit power and the power for UAVs mobility, and the ground user density are taken into account. Instead of convent...

Journal: :European Journal of Operational Research 1999
Young H. Chun

We consider the problem of selecting the single best choice when several groups of choices are presented sequentially for evaluation. In the so-called group interview problem, we assume that the values of choices are random observations from a known distribution function and derive the optimal search strategy that maximizes the probability of selecting the best among all choices. Under the opti...

2015
F. I. Dehayem Nodem J. P. Kenné A. Gharbi

This paper presents a method to find the optimal production, repair/replacement and preventive maintenance policies for a degraded manufacturing system. The system is subject to random machine failures and repairs. The status of the system is deemed to degrade with repair activities. When a failure occurs, the machine is either repaired or replaced, and a replacement action renews the machine, ...

Journal: :CoRR 2017
Yijie Peng Edwin K. P. Chong Chun-Hung Chen Michael C. Fu

Under a Bayesian framework, we formulate the fully sequential sampling and selection decision in statistical ranking and selection as a stochastic control problem, and derive the associated Bellman equation. Using value function approximation, we derive an approximately optimal allocation policy. We show that this policy is not only computationally efficient but also possesses both one-step-ahe...

2007
Vinay Chande Nariman Farvardin

We consider the problem of design of a source-channel decoder for transmission of a vector quantized source over a noisy memoryless channel with a retransmission based protocol such as ARQ or Type-I hybrid ARQ. First we show that the problem of design of optimal ACK/NACK generation and decoding by packet combining can be cast and solved as a sequential decision problem. The optimal solutions fo...

2005
Kun-Mao Chao

Dynamic programming is a class of solution methods for solving sequential decision problems with a compositional cost structure. It is one of the major paradigms of algorithm design in computer science. The name was given in 1957 by Richard Bellman. The word “programming” both here and in linear programming refers to a tabular method that makes a series of choices, not to writing computer code....

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید