IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v30y1996i1p60-74.html
   My bibliography  Save this article

Optimal Allocation of Two Fixed Service Units Acting as M / G /1 Queues

Author

Listed:
  • Carlo Filippi

    (Department of Pure and Applied Mathematics, University of Padova, Via Belzoni, 7, 35131 Padova, Italy)

  • Giorgio Romanin-Jacur

    (Department of Electronics and Informatics, University of Padova, Via Gradenigo 6/A, 35131 Padova, Italy)

Abstract

We consider a districting problem placed in the general context of optimal allocation of urgent services in the presence of congestion. Customers are located in fixed points of a physical space and ask for urgent service according to Poisson processes. Two facilities, located in fixed points, supply the service by acting as M / G /1 queues. Each customer shall be assigned to one of the two facilities so that the mean expected response time is minimized, where the response time is the sum of the transportation time, the wait-in-queue time and the service time. We formalize the problem as an integer nonlinear programming model and we exactly solve it by a suitable branch-and-bound procedure. We show that the problem, if relaxed with respect to integrality constraints, can be reduced to an equivalent convex minimization problem with only one variable. Actually, each step of the branch-and-bound procedure is performed by quickly solving a continuous single-variable minimization problem. We randomly generate a large amount of instances of practical size, and we solve them on a workstation. Short computing times (

Suggested Citation

  • Carlo Filippi & Giorgio Romanin-Jacur, 1996. "Optimal Allocation of Two Fixed Service Units Acting as M / G /1 Queues," Transportation Science, INFORMS, vol. 30(1), pages 60-74, February.
    • Handle: RePEc:inm:ortrsc:v:30:y:1996:i:1:p:60-74
    DOI: 10.1287/trsc.30.1.60
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.30.1.60
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.30.1.60?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:inm:ortrsc:v:30:y:1996:i:1:p:60-74. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.