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

Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering

Author

Listed:
  • Pekergin, Nihal
  • Dayar, Tugrul
  • Alparslan, Denizhan N.

Abstract

No abstract is available for this item.

Suggested Citation

  • Pekergin, Nihal & Dayar, Tugrul & Alparslan, Denizhan N., 2005. "Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering," European Journal of Operational Research, Elsevier, vol. 165(3), pages 810-825, September.
    • Handle: RePEc:eee:ejores:v:165:y:2005:i:3:p:810-825
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(04)00128-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. William A. Massey, 1987. "Stochastic Orderings for Markov Processes on Partially Ordered Spaces," Mathematics of Operations Research, INFORMS, vol. 12(2), pages 350-367, May.
    2. Kamburowski, Jerzy, 1999. "Stochastically minimizing the makespan in two-machine flow shops without blocking," European Journal of Operational Research, Elsevier, vol. 112(2), pages 304-309, January.
    3. Keilson, Julian & Kester, Adri, 1977. "Monotone matrices and monotone Markov processes," Stochastic Processes and their Applications, Elsevier, vol. 5(3), pages 231-241, July.
    4. Winfried K. Grassmann & Michael I. Taksar & Daniel P. Heyman, 1985. "Regenerative Analysis and Steady State Distributions for Markov Chains," Operations Research, INFORMS, vol. 33(5), pages 1107-1116, October.
    Full references (including those not matched with items on IDEAS)

    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. Jing‐Sheng Song & Paul H. Zipkin, 2012. "Newsvendor problems with sequentially revealed demand information," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(8), pages 601-612, December.
    2. Karantounias, Anastasios G., 2023. "Doubts about the model and optimal policy," Journal of Economic Theory, Elsevier, vol. 210(C).
    3. J Jackman & Z Guerra de Castillo & S Olafsson, 2011. "Stochastic flow shop scheduling model for the Panama Canal," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(1), pages 69-80, January.
    4. Roland Benabou & Efe A. Ok, 2001. "Social Mobility and the Demand for Redistribution: The Poum Hypothesis," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 116(2), pages 447-487.
    5. P J Kalczynski & J Kamburowski, 2004. "Generalization of Johnson's and Talwar's scheduling rules in two-machine stochastic flow shops," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(12), pages 1358-1362, December.
    6. Harkins, Andrew, 2020. "Network Comparative Statics," The Warwick Economics Research Paper Series (TWERPS) 1306, University of Warwick, Department of Economics.
    7. Xuefeng Gao & S. J. Deng, 2014. "Hydrodynamic limit of order book dynamics," Papers 1411.7502, arXiv.org, revised Feb 2016.
    8. Tijms, H.C. & Coevering, M.C.T. van de, 1990. "How to solve numerically the equilibrium equations of a Markov chain with infinitely many states," Serie Research Memoranda 0046, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    9. S. K. Samanta & R. Nandi, 2021. "Queue-Length, Waiting-Time and Service Batch Size Analysis for the Discrete-Time GI/D-MSP (a,b) / 1 / ∞ $^{\text {(a,b)}}/1/\infty $ Queueing System," Methodology and Computing in Applied Probability, Springer, vol. 23(4), pages 1461-1488, December.
    10. A. Banik & U. Gupta, 2007. "Analyzing the finite buffer batch arrival queue under Markovian service process: GI X /MSP/1/N," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 146-160, July.
    11. Danny Ben‐Shahar & Eyal Sulganik, 2008. "Partial Ordering of Unpredictable Mobility with Welfare Implications," Economica, London School of Economics and Political Science, vol. 75(299), pages 592-604, August.
    12. Forbes, Florence & François, Olivier, 1997. "Stochastic comparison for Markov processes on a product of partially ordered sets," Statistics & Probability Letters, Elsevier, vol. 33(3), pages 309-320, May.
    13. Kao, Edward P. C. & Wilson, Sandra D., 1999. "Analysis of nonpreemptive priority queues with multiple servers and two priority classes," European Journal of Operational Research, Elsevier, vol. 118(1), pages 181-193, October.
    14. Okada, Daijiro & Tercieux, Olivier, 2012. "Log-linear dynamics and local potential," Journal of Economic Theory, Elsevier, vol. 147(3), pages 1140-1164.
    15. Amod J. Basnet & Isaac M. Sonin, 2022. "Parallel computing for Markov chains with islands and ports," Annals of Operations Research, Springer, vol. 317(2), pages 335-352, October.
    16. Souvik Ghosh & A. D. Banik & Joris Walraevens & Herwig Bruneel, 2022. "A detailed note on the finite-buffer queueing system with correlated batch-arrivals and batch-size-/phase-dependent bulk-service," 4OR, Springer, vol. 20(2), pages 241-272, June.
    17. Portougal, Victor & Trietsch, Dan, 2006. "Johnson's problem with stochastic processing times and optimal service level," European Journal of Operational Research, Elsevier, vol. 169(3), pages 751-760, March.
    18. A. D. Banik & M. L. Chaudhry & U. C. Gupta, 2008. "On the Finite Buffer Queue with Renewal Input and Batch Markovian Service Process: GI/BMSP/1/N," Methodology and Computing in Applied Probability, Springer, vol. 10(4), pages 559-575, December.
    19. Lasse Leskelä, 2022. "Ross’s second conjecture and supermodular stochastic ordering," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 213-215, April.
    20. Senthil K. Veeraraghavan & Laurens G. Debo, 2011. "Herding in Queues with Waiting Costs: Rationality and Regret," Manufacturing & Service Operations Management, INFORMS, vol. 13(3), pages 329-346, July.

    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:165:y:2005:i:3:p:810-825. 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.