IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v21y1974i2p361-364.html
   My bibliography  Save this article

Order‐preserving allocation of jobs to two machines

Author

Listed:
  • S. Mehta
  • R. Chandraseharan
  • H. Emmons

Abstract

In this paper, we consider the problem of minimizing the mean flow time of jobs to be processed on two machines. The jobs have a predetermined order, perhaps reflecting the order of arrival, and each job has a known processing time. We wish to assign the jobs to machines so as to minimize the mean flow time, with the constraint that the original order must be preserved within the subset of jobs assigned to each machine. An efficient algorithm based on dynamic programming is developed.

Suggested Citation

  • S. Mehta & R. Chandraseharan & H. Emmons, 1974. "Order‐preserving allocation of jobs to two machines," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 21(2), pages 361-364, June.
    • Handle: RePEc:wly:navlog:v:21:y:1974:i:2:p:361-364
    DOI: 10.1002/nav.3800210215
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800210215
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800210215?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:wly:navlog:v:21:y:1974:i:2:p:361-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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    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.