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

Minimizing Flow Time on Parallel Identical Processors with Variable Unit Processing Time

Author

Listed:
  • I. Meilijson

    (Tel-Aviv University, Tel-Aviv, Israel)

  • A. Tamir

    (Tel-Aviv University, Tel-Aviv, Israel)

Abstract

We show that minimizing total flow time on parallel identical processors with nonincreasing unit processing time is achieved with shortest processing time (SPT) scheduling: Sequence the tasks in an order of nondecreasing lengths. Following this order and starting with the shortest task, process any task by the first processor that becomes available. If the unit processing time is allowed to be increasing, e.g., quadratically, the problem becomes NP-hard.

Suggested Citation

  • I. Meilijson & A. Tamir, 1984. "Minimizing Flow Time on Parallel Identical Processors with Variable Unit Processing Time," Operations Research, INFORMS, vol. 32(2), pages 440-448, April.
    • Handle: RePEc:inm:oropre:v:32:y:1984:i:2:p:440-448
    DOI: 10.1287/opre.32.2.440
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.32.2.440
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.32.2.440?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. Reddy Dondeti, V. & Mohanty, Bidhu B., 1998. "Impact of learning and fatigue factors on single machine scheduling with penalties for tardy jobs," European Journal of Operational Research, Elsevier, vol. 105(3), pages 509-524, March.
    2. Bahram Alidaee & Haibo Wang & R. Bryan Kethley & Frank Landram, 2019. "A unified view of parallel machine scheduling with interdependent processing rates," Journal of Scheduling, Springer, vol. 22(5), pages 499-515, October.

    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:32:y:1984:i:2:p:440-448. 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.