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

Parallel Scheduling Algorithms

Author

Listed:
  • Eliezer Dekel

    (University of Minnesota, Minneapolis, Minnesota)

  • Sartaj Sahni

    (University of Minnesota, Minneapolis, Minnesota)

Abstract

Parallel algorithms are given for scheduling problems such as scheduling to minimize the number of tardy jobs, job sequencing with deadlines, scheduling to minimize earliness and tardiness penalties, channel assignment, and minimizing the mean finish time. The shared memory model of parallel computers is used to obtain fast algorithms.

Suggested Citation

  • Eliezer Dekel & Sartaj Sahni, 1983. "Parallel Scheduling Algorithms," Operations Research, INFORMS, vol. 31(1), pages 24-49, February.
    • Handle: RePEc:inm:oropre:v:31:y:1983:i:1:p:24-49
    DOI: 10.1287/opre.31.1.24
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.31.1.24
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.31.1.24?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. Antoon W.J. Kolen & Jan Karel Lenstra & Christos H. Papadimitriou & Frits C.R. Spieksma, 2007. "Interval scheduling: A survey," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(5), pages 530-543, August.
    2. Toly Chen & Chi-Wei Lin, 2017. "Estimating the simulation workload for factory simulation as a cloud service," Journal of Intelligent Manufacturing, Springer, vol. 28(5), pages 1139-1157, June.

    More about this item

    Keywords

    584 parallel scheduling algorithms;

    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:31:y:1983:i:1:p:24-49. 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.