IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v29y1981i6p1212-1217.html
   My bibliography  Save this article

Technical Note—Further Results on an Infinite Capacity Shuttle with Control at a Single Terminal

Author

Listed:
  • Howard J. Weiss

    (Temple University, Philadelphia, Pennsylvania)

Abstract

The infinite capacity shuttle system that is described by Ignall and Kolesar (Ignall, E., P. Kolesar. 1974. Optimal dispatching of an infinite capacity shuttle: Control at a single terminal. Opns. Res. 22 1008–1024.) is considered. Passengers arrive at each of two terminals according to independent Poisson Processes. The vehicle can be held at only one of the terminals. When the vehicle is dispatched it transports all of the passengers waiting at terminal 1 to terminal 2, immediately picks up the passengers at terminal 2 and returns to terminal 1. It is known that under general conditions the optimal vehicle dispatching policy is a control limit policy: Dispatch the shuttle if and only if the number of passengers waiting at both terminals is at least as large as some cutoff value. In this paper a method for computing the optimal cutoff value is presented. In addition we examine the savings that result when using a control limit policy rather than the more traditional policy of scheduled periodic service. Last, we prove a conjecture by Ignall and Kolesar regarding the optimal policy for instances when the dispatcher does not know the number of passengers waiting at terminal 2.

Suggested Citation

  • Howard J. Weiss, 1981. "Technical Note—Further Results on an Infinite Capacity Shuttle with Control at a Single Terminal," Operations Research, INFORMS, vol. 29(6), pages 1212-1217, December.
    • Handle: RePEc:inm:oropre:v:29:y:1981:i:6:p:1212-1217
    DOI: 10.1287/opre.29.6.1212
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.29.6.1212
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.29.6.1212?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
    ---><---

    Citations

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


    Cited by:

    1. Katerina P. Papadaki & Warren B. Powell, 2003. "An adaptive dynamic programming algorithm for a stochastic multiproduct batch dispatch problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(7), pages 742-769, October.

    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:oropre:v:29:y:1981:i:6:p:1212-1217. 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.