IDEAS home Printed from https://ideas.repec.org/a/igg/jsds00/v2y2011i3p38-54.html
   My bibliography  Save this article

Two-Facility Location Problem with Infinite Retrial Queue

Author

Listed:
  • Ebrahim Teimoury

    (Iran University of Science and Technology, Iran)

  • Mohammad Modarres Yazdi

    (Sharif University of Technology, Iran)

  • Iman Ghaleh Khondabi

    (ETKA Center of Advanced Science and Technology, Iran)

  • Mahdi Fathi

    (Iran University of Science and Technology, Iran)

Abstract

This paper analyzes a two-facility location problem under demand uncertainty. The maximum server for the ith facility is . It is assumed that primary service demand arrivals for the ith facility follow a Poisson process. Each customer chooses one of the facilities with a probability which depends on his or her distance to each facility. The service times are assumed to be exponential and there is no vacation or failure in the system. Both facilities are assumed to be substitutable which means that if a facility has no free server, the other facility is used to fulfill the demand. When there is no idle server in both facilities, each arriving primary demand goes into an orbit of unlimited size. The orbiting demands retry to get service following an exponential distribution. In this paper, the authors give a stability condition of the demand satisfying process, and then obtain the steady-state distribution by applying matrix geometric method in order to calculation of some key performance indexes. By considering the fixed cost of opening a facility and the steady state service costs, the best locations for two facilities are derived. The result is illustrated by a numerical example.

Suggested Citation

  • Ebrahim Teimoury & Mohammad Modarres Yazdi & Iman Ghaleh Khondabi & Mahdi Fathi, 2011. "Two-Facility Location Problem with Infinite Retrial Queue," International Journal of Strategic Decision Sciences (IJSDS), IGI Global, vol. 2(3), pages 38-54, July.
  • Handle: RePEc:igg:jsds00:v:2:y:2011:i:3:p:38-54
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jsds.2011070103
    Download Restriction: no
    ---><---

    Citations

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


    Cited by:

    1. Wang, Fong-Fan, 2023. "An efficient optimization procedure for location-inventory problems with (S-1, S) policy and retrial demands," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 206(C), pages 664-688.

    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:igg:jsds00:v:2:y:2011:i:3:p:38-54. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    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.