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

Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time

Author

Listed:
  • Lee A. Herrbach

    (AT&T Bell Laboratories, Naperville, Illinois)

  • Joseph Y.-T. Leung

    (University of Texas at Dallas, Richardson, Texas)

Abstract

We give an O ( n log n ) time algorithm to preemptively schedule n equal-length jobs with release times on two identical, parallel machines so as to minimize the mean flow time. The complexity of the general problem of minimizing the mean weighted flow time is also reviewed, both for nonpreemptive and preemptive scheduling.

Suggested Citation

  • Lee A. Herrbach & Joseph Y.-T. Leung, 1990. "Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time," Operations Research, INFORMS, vol. 38(3), pages 487-494, June.
    • Handle: RePEc:inm:oropre:v:38:y:1990:i:3:p:487-494
    DOI: 10.1287/opre.38.3.487
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.38.3.487
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.38.3.487?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. Jiang, Xiaojuan & Lee, Kangbok & Pinedo, Michael L., 2021. "Ideal schedules in parallel machine settings," European Journal of Operational Research, Elsevier, vol. 290(2), pages 422-434.
    2. Lushchakova, Irina N., 2012. "Preemptive scheduling of two uniform parallel machines to minimize total tardiness," European Journal of Operational Research, Elsevier, vol. 219(1), pages 27-33.
    3. Azizoglu, Meral, 2003. "Preemptive scheduling on identical parallel machines subject to deadlines," European Journal of Operational Research, Elsevier, vol. 148(1), pages 205-210, July.
    4. Lushchakova, Irene N., 2006. "Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints," European Journal of Operational Research, Elsevier, vol. 171(1), pages 107-122, May.
    5. Bo Chen & Ed Coffman & Dariusz Dereniowski & Wiesław Kubiak, 2016. "Normal-form preemption sequences for an open problem in scheduling theory," Journal of Scheduling, Springer, vol. 19(6), pages 701-728, December.

    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:38:y:1990:i:3:p:487-494. 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.