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

Scheduling Independent Tasks on Parallel Processors

Author

Listed:
  • Michael H. Rothkopf

    (Massachusetts Institute of Technology)

Abstract

This paper considers the problem of scheduling m independent, immediately available tasks on n parallel processors. Each task has a waiting cost rate, that is a function of time, and a service time. There are no feasibility restrictions on the order in which the tasks are to be processed. An optimal scheduling rule is presented for the single processor scheduling of tasks with continuously discounted linear waiting costs. A dynamic programming algorithm has been developed for a wide class of parallel-processor problems. Linear waiting costs (with or without discounting), arbitrary processor use costs, and certain other costs are considered. In certain cases, the service time of a task may be a function of the processor that performs it.

Suggested Citation

  • Michael H. Rothkopf, 1966. "Scheduling Independent Tasks on Parallel Processors," Management Science, INFORMS, vol. 12(5), pages 437-447, January.
    • Handle: RePEc:inm:ormnsc:v:12:y:1966:i:5:p:437-447
    DOI: 10.1287/mnsc.12.5.437
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.12.5.437
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.12.5.437?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:12:y:1966:i:5:p:437-447. 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.