Skip to main content
SpringerLink
Log in

The problem of minimizing the sum of penalties in scheduling

  • Published:
Cybernetics Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. R. McNaughton, Scheduling with deadline and loss functions, Manag. Sci., I, No. 6, 1951.

  2. M. Rothkopf, Scheduling independent tasks on parallel processors, Manag. Sci., 12, No. 5, 1966.

  3. V. V. Shkurba, et al., Problems of Calendar Planning and Methods for Their Solution [in Russian], Kiev, 1966.

Download references

Authors
  1. G. K. Kladov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. M. Livshits
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Physicotechnical Institute for Low Temperatures, Academy of Sciences of the Ukrainian SSR, Khar'kov. Translated from Kibernetika, Vol. 4, No. 6, pp. 99–100, November–December, 1968.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kladov, G.K., Livshits, E.M. The problem of minimizing the sum of penalties in scheduling. Cybern Syst Anal 4, 124–126 (1968). https://doi.org/10.1007/BF01071504

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01071504

Keywords

Search

Navigation