Skip to main content
SpringerLink
Log in

Order-of-priority intervals in the penalty minimization problem

  • 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. E. Salah Elmaghraby, “The sequencing of related jobs,” Naval Research Logist. Quarterly,15, No. 1 (1968).

  2. V. V. Shkurba, “Order-of-priority intervals in ordering problems,” Kibernetika, No. 2 (1970).

  3. R. W. Conway, W. L. Maxwell, and L. W. Miller, Theory of Scheduling, Addison-Wesley (1967).

  4. V. Ya. Burdyuk, “The n/1+1/F problem with blocking,” in Collections of Papers by Aspirants at the Dniepropetrovsk State University (Mathematics and Mechanics) [in Russian], Izd. Dnepropetrovskogo Gosuniversiteta (1970).

  5. A. A. Korbut and Yu. Yu. Finkel'shtein, Discrete Programming [in Russian], Izd. Nauka, Moscow (1969).

    Google Scholar 

Download references

Authors
  1. T. A. Burdyuk
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 5, pp. 106–110, September–October, 1973.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Burdyuk, T.A. Order-of-priority intervals in the penalty minimization problem. Cybern Syst Anal 9, 848–854 (1973). https://doi.org/10.1007/BF01069723

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation