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

A Problem in Bulk Service Scheduling

Author

Listed:
  • G. L. Nemhauser

    (Cornell University, Ithaca, New York)

  • P. L. Yu

    (University of Rochester, Rochester, New York)

Abstract

Given the operating costs, usage function, and planning horizon of a bulk service system, say a common-carrier transportation system, the objective is to determine the number and the starting times of the services so that the total profit is maximized. For such problems, this paper studies the existence and computability of optimal schedules. It shows that an ϵ-optimal schedule can be found by a discrete optimization on a sufficiently fine grid. It then makes more specific assumptions regarding the dependence of usage on the schedule and presents a dynamic-programming algorithm for the discrete optimization. Finally, an analytic solution is given for a simple case.

Suggested Citation

  • G. L. Nemhauser & P. L. Yu, 1972. "A Problem in Bulk Service Scheduling," Operations Research, INFORMS, vol. 20(4), pages 813-819, August.
    • Handle: RePEc:inm:oropre:v:20:y:1972:i:4:p:813-819
    DOI: 10.1287/opre.20.4.813
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.20.4.813
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.20.4.813?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. Xu, Jianjun & Serrano, Alejandro & Lin, Bing, 2017. "Optimal production and rationing policy of two-stage tandem production system," International Journal of Production Economics, Elsevier, vol. 185(C), pages 100-112.

    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:oropre:v:20:y:1972:i:4:p:813-819. 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.