IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v23y1977i6p567-575.html
   My bibliography  Save this article

Minimising Waiting Time Variance in the Single Machine Problem

Author

Listed:
  • Samuel Eilon

    (Imperial College, London)

  • I. G. Chowdhury

    (Imperial College, London)

Abstract

The paper considers the problem of n given jobs to be processed on a single machine where it is desirable to minimise the variance of job waiting times. A theorem is presented to the effect that the optimal sequence must be V-shaped (i.e., the jobs must be arranged in descending order of processing times if they are placed before the shortest job, but in ascending order of processing times if placed after it), and an algorithm for determining the optimal solution is given. A heuristic method is proposed for solving the problem where n is large; this method requires very little computing and was found to produce very good results for a sample of problems of varying size. The concept of the "efficient set" is examined and heuristic methods for generating this set are given.

Suggested Citation

  • Samuel Eilon & I. G. Chowdhury, 1977. "Minimising Waiting Time Variance in the Single Machine Problem," Management Science, INFORMS, vol. 23(6), pages 567-575, February.
    • Handle: RePEc:inm:ormnsc:v:23:y:1977:i:6:p:567-575
    DOI: 10.1287/mnsc.23.6.567
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.23.6.567
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.23.6.567?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:ormnsc:v:23:y:1977:i:6:p:567-575. 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.