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

Single Facility Sequencing with Random Execution Times

Author

Listed:
  • B. P. Banerjee

    (International Business Machines Corporation, Advanced Systems Development Division, Yorktown Heights, New York)

Abstract

A single facility sequencing problem where the execution time for each job at the facility is random with known probability distribution, is formulated and solved. The solution is shown to be easily extended to situations where further jobs arrive while the program is in operation. Further extensions are discussed, where (a) the facility is taken to consist of multiple (identical or otherwise) units of equipment and, (b) special priorities are attached to some of the jobs.

Suggested Citation

  • B. P. Banerjee, 1965. "Single Facility Sequencing with Random Execution Times," Operations Research, INFORMS, vol. 13(3), pages 358-364, June.
    • Handle: RePEc:inm:oropre:v:13:y:1965:i:3:p:358-364
    DOI: 10.1287/opre.13.3.358
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.13.3.358
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.13.3.358?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. Elmaghraby, Salah E., 2001. "On the optimal release time of jobs with random processing times, with extensions to other criteria," International Journal of Production Economics, Elsevier, vol. 74(1-3), pages 103-113, December.
    2. K. D. Glazebrook, 1995. "A suboptimality bound for permutation policies in single machine stochastic scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(6), pages 993-1005, September.

    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:13:y:1965:i:3:p:358-364. 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.