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

On Scheduling Tasks with Associated Linear Loss Functions

Author

Listed:
  • Albert Schild

    (RCA Service Company, Cherry Hill, Camden, New Jersey, and Temple University, Philadelphia, Pennsylvania)

  • Irwin J. Fredman

    (RCA Service Company, Cherry Hill, Camden, New Jersey)

Abstract

In a recent paper in Management Science, Robert McNaughton has discussed certain problems encountered in scheduling tasks on one or more processors when penalties are imposed if the tasks are finished after their respective deadlines. In this paper, the general problem of scheduling the tasks on one processor in order to minimize the total loss is solved, and McNaughton's results are generalized.

Suggested Citation

  • Albert Schild & Irwin J. Fredman, 1961. "On Scheduling Tasks with Associated Linear Loss Functions," Management Science, INFORMS, vol. 7(3), pages 280-285, April.
    • Handle: RePEc:inm:ormnsc:v:7:y:1961:i:3:p:280-285
    DOI: 10.1287/mnsc.7.3.280
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.7.3.280
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.7.3.280?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. Christian L. Cesar & Peter G. Jessel, 1992. "Real‐time task scheduling with overheads considered," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(2), pages 247-264, March.
    2. Vink, Wouter & Kuiper, Alex & Kemper, Benjamin & Bhulai, Sandjai, 2015. "Optimal appointment scheduling in continuous time: The lag order approximation method," European Journal of Operational Research, Elsevier, vol. 240(1), pages 213-219.
    3. Sen, Tapan & Sulek, Joanne M. & Dileepan, Parthasarati, 2003. "Static scheduling research to minimize weighted and unweighted tardiness: A state-of-the-art survey," International Journal of Production Economics, Elsevier, vol. 83(1), pages 1-12, January.
    4. Holsenback, J. E. & Russell, R. M. & Markland, R. E. & Philipoom, P. R., 1999. "An improved heuristic for the single-machine, weighted-tardiness problem," Omega, Elsevier, vol. 27(4), pages 485-495, August.

    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:7:y:1961:i:3:p:280-285. 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.