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

The Optimal Look-Ahead Policy for Admission to a Single Server System

Author

Listed:
  • W. M. Nawijn

    (Twente University of Technology, Enschede, The Netherlands)

Abstract

This paper considers a service system with a single server, finite waiting room, and a renewal arrival process. Customers who arrive while the server is busy are lost. Upon completing service, the server chooses between two actions: either he immediately starts a new service, provided a customer is present, or he admits the newly arrived customer to the system, but delays service pending the next arrival, whereupon he again chooses between these two actions. This process continues until either the system is full or a new service is started. Once a service has been started, all customers who arrive while the server is busy are lost. We assume that at each decision epoch the server knows the arrival epoch of the first arriving customer. We show that there exists an optimal control-limit policy that minimizes the average expected idle time per customer served (equivalently, maximizes the average number of customers served per unit of time). The special case of Poisson arrivals leads to an explicit expression for this delay that generalizes exisiting results.

Suggested Citation

  • W. M. Nawijn, 1985. "The Optimal Look-Ahead Policy for Admission to a Single Server System," Operations Research, INFORMS, vol. 33(3), pages 625-643, June.
    • Handle: RePEc:inm:oropre:v:33:y:1985:i:3:p:625-643
    DOI: 10.1287/opre.33.3.625
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.33.3.625
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.33.3.625?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. Feyzbakhsh, S. A. & Matsui, M. & Itai, K., 1998. "Optimal design of a generalized conveyor-serviced production station: Fixed and removal item cases," International Journal of Production Economics, Elsevier, vol. 55(2), pages 177-189, July.
    2. Tang, Hao & Xu, Lingling & Sun, Jing & Chen, Yingjun & Zhou, Lei, 2015. "Modeling and optimization control of a demand-driven, conveyor-serviced production station," European Journal of Operational Research, Elsevier, vol. 243(3), pages 839-851.

    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:33:y:1985:i:3:p:625-643. 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.