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

Scheduling Tasks with Deadlines and Non-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

The problem of scheduling tasks with deadlines and linear loss functions was discussed in some detail in two papers [McNaughton, R. Scheduling with deadlines and loss functions. Management Sci. 6(1) 1-12; Schild, A., I. J. Fredman. On scheduling tasks with associated linear loss functions. Management Sci. 7(3) 280-285] by Robert McNaughton and the authors. In this paper, the problem of scheduling with nonlinear loss functions is attacked. In particular, certain criteria will be established for quadratic loss functions and an algorithm is proposed which will yield an optimal scheduling--i.e., a minimal total loss--for nonlinear loss functions in general.

Suggested Citation

  • Albert Schild & Irwin J. Fredman, 1962. "Scheduling Tasks with Deadlines and Non-Linear Loss Functions," Management Science, INFORMS, vol. 9(1), pages 73-81, October.
    • Handle: RePEc:inm:ormnsc:v:9:y:1962:i:1:p:73-81
    DOI: 10.1287/mnsc.9.1.73
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.9.1.73
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.9.1.73?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. Schaller, Jeffrey, 2002. "Minimizing the sum of squares lateness on a single machine," European Journal of Operational Research, Elsevier, vol. 143(1), pages 64-79, November.

    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:9:y:1962:i:1:p:73-81. 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.