IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v164y2005i2p378-386.html
   My bibliography  Save this article

Reliability function of a class of time-dependent systems with standby redundancy

Author

Listed:
  • Azaron, Amir
  • Katagiri, Hideki
  • Sakawa, Masatoshi
  • Modarres, Mohammad

Abstract

No abstract is available for this item.

Suggested Citation

  • Azaron, Amir & Katagiri, Hideki & Sakawa, Masatoshi & Modarres, Mohammad, 2005. "Reliability function of a class of time-dependent systems with standby redundancy," European Journal of Operational Research, Elsevier, vol. 164(2), pages 378-386, July.
    • Handle: RePEc:eee:ejores:v:164:y:2005:i:2:p:378-386
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(04)00025-6
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. H. Frank, 1969. "Shortest Paths in Probabilistic Graphs," Operations Research, INFORMS, vol. 17(4), pages 583-599, August.
    2. J. J. Martin, 1965. "Distribution of the Time Through a Directed, Acyclic Network," Operations Research, INFORMS, vol. 13(1), pages 46-66, February.
    3. George S. Fishman, 1986. "A Monte Carlo Sampling Plan for Estimating Network Reliability," Operations Research, INFORMS, vol. 34(4), pages 581-594, August.
    4. Sigal, C.E. & Pritsker, A.A.B. & Solberg, J.J., 1979. "The use of cutsets in Monte Carlo analysis of stochastic networks," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 21(4), pages 376-384.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jørgen Vitting Andersen & Roy Cerqueti & Jessica Riccioni, 2023. "Rational expectations as a tool for predicting failure of weighted k-out-of-n reliability systems," Post-Print hal-03634370, HAL.
    2. Jørgen Vitting Andersen & Roy Cerqueti & Giulia Rotundo, 2017. "Rational expectations and stochastic systems," Documents de travail du Centre d'Economie de la Sorbonne 17060, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne, revised Oct 2019.
    3. Jorgen Vitting Andersen & Roy Cerqueti & Jessica Riccioni, 2021. "Rational expectations as a tool for predicting failure of weighted k-out-of-n reliability systems," Papers 2112.10672, arXiv.org.
    4. Delia Montoro-Cazorla & Rafael Pérez-Ocón, 2022. "Optimizing Costs in a Reliability System under Markovian Arrival of Failures and Reposition by K -Policy Inspection," Mathematics, MDPI, vol. 10(11), pages 1-21, June.
    5. Jorgen-Vitting Andersen & Roy Cerqueti & Jessica Riccioni, 2023. "Rational expectations as a tool for predicting failure of weighted k-out-of-n reliability systems," Annals of Operations Research, Springer, vol. 326(1), pages 295-316, July.
    6. Jørgen Vitting Andersen & Roy Cerqueti & Jessica Riccioni, 2023. "Rational expectations as a tool for predicting failure of weighted k-out-of-n reliability systems," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-03634370, HAL.
    7. Ardakan, Mostafa Abouei & Amini, Hanieh & Juybari, Mohammad N., 2022. "Prescheduled switching time: A new strategy for systems with standby components," Reliability Engineering and System Safety, Elsevier, vol. 218(PB).
    8. Kayedpour, Farjam & Amiri, Maghsoud & Rafizadeh, Mahmoud & Shahryari Nia, Arash, 2017. "Multi-objective redundancy allocation problem for a system with repairable components considering instantaneous availability and strategy selection," Reliability Engineering and System Safety, Elsevier, vol. 160(C), pages 11-20.
    9. Levitin, Gregory & Amari, Suprasad V., 2010. "Approximation algorithm for evaluating time-to-failure distribution of k-out-of-n system with shared standby elements," Reliability Engineering and System Safety, Elsevier, vol. 95(4), pages 396-401.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. R. Alan Bowman, 2003. "Sensitivity curves for effective project management," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(5), pages 481-497, August.
    2. Elmaghraby, Salah E., 2000. "On criticality and sensitivity in activity networks," European Journal of Operational Research, Elsevier, vol. 127(2), pages 220-238, December.
    3. Sigal, C.E. & Pritsker, A.A.B. & Solberg, J.J., 1979. "The use of cutsets in Monte Carlo analysis of stochastic networks," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 21(4), pages 376-384.
    4. Azaron, Amir & Fatemi Ghomi, S. M. T., 2003. "Optimal control of service rates and arrivals in Jackson networks," European Journal of Operational Research, Elsevier, vol. 147(1), pages 17-31, May.
    5. Daniel Reich & Leo Lopes, 2011. "Preprocessing Stochastic Shortest-Path Problems with Application to PERT Activity Networks," INFORMS Journal on Computing, INFORMS, vol. 23(3), pages 460-469, August.
    6. Fatemi Ghomi, S. M. T. & Hashemin, S. S., 1999. "A new analytical algorithm and generation of Gaussian quadrature formula for stochastic network," European Journal of Operational Research, Elsevier, vol. 114(3), pages 610-625, May.
    7. Azaron, Amir & Katagiri, Hideki & Sakawa, Masatoshi & Kato, Kosuke & Memariani, Azizollah, 2006. "A multi-objective resource allocation problem in PERT networks," European Journal of Operational Research, Elsevier, vol. 172(3), pages 838-854, August.
    8. Azaron, Amir & Kianfar, Farhad, 2003. "Dynamic shortest path in stochastic dynamic networks: Ship routing problem," European Journal of Operational Research, Elsevier, vol. 144(1), pages 138-156, January.
    9. Bregman, Robert L., 2009. "A heuristic procedure for solving the dynamic probabilistic project expediting problem," European Journal of Operational Research, Elsevier, vol. 192(1), pages 125-137, January.
    10. Yongjia Song & Siqian Shen, 2016. "Risk-Averse Shortest Path Interdiction," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 527-539, August.
    11. Fatemi Ghomi, S. M. T. & Teimouri, E., 2002. "Path critical index and activity critical index in PERT networks," European Journal of Operational Research, Elsevier, vol. 141(1), pages 147-152, August.
    12. Timothy M. Sweda & Irina S. Dolinskaya & Diego Klabjan, 2017. "Adaptive Routing and Recharging Policies for Electric Vehicles," Transportation Science, INFORMS, vol. 51(4), pages 1326-1348, November.
    13. K.-P. Hui & N. Bean & M. Kraetzl & Dirk Kroese, 2005. "The Cross-Entropy Method for Network Reliability Estimation," Annals of Operations Research, Springer, vol. 134(1), pages 101-118, February.
    14. Fatemi Ghomi, S. M. T. & Rabbani, M., 2003. "A new structural mechanism for reducibility of stochastic PERT networks," European Journal of Operational Research, Elsevier, vol. 145(2), pages 394-402, March.
    15. Azaron, Amir & Fatemi Ghomi, S.M.T., 2008. "Lower bound for the mean project completion time in dynamic PERT networks," European Journal of Operational Research, Elsevier, vol. 186(1), pages 120-127, April.
    16. Cook, Jason L. & Ramirez-Marquez, Jose Emmanuel, 2009. "Optimal design of cluster-based ad-hoc networks using probabilistic solution discovery," Reliability Engineering and System Safety, Elsevier, vol. 94(2), pages 218-228.
    17. Murthy, Ishwar & Sarkar, Sumit, 1997. "Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function," European Journal of Operational Research, Elsevier, vol. 103(1), pages 209-229, November.
    18. Azaron, Amir & Fynes, Brian & Modarres, Mohammad, 2011. "Due date assignment in repetitive projects," International Journal of Production Economics, Elsevier, vol. 129(1), pages 79-85, January.
    19. Bi Chen & William Lam & Agachai Sumalee & Qingquan Li & Hu Shao & Zhixiang Fang, 2013. "Finding Reliable Shortest Paths in Road Networks Under Uncertainty," Networks and Spatial Economics, Springer, vol. 13(2), pages 123-148, June.
    20. Yueyue Fan & Yu Nie, 2006. "Optimal Routing for Maximizing the Travel Time Reliability," Networks and Spatial Economics, Springer, vol. 6(3), pages 333-344, September.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:164:y:2005:i:2:p:378-386. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.