Skip to main content
Log in

Probabilistic approach to the solution of the priority problem

  • Published:
Cybernetics Aims and scope

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

Access this article

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

Instant access to the full article PDF.

Literature Cited

  1. V. V. Shkurba, “Computational schemata for the solution of scheduling problems,” Kibernetika, No. 3 (1965).

  2. V. V. Shkurba, T. P. Podchasova, A. N., Pshichuk, and L. P. Tur, Timetable Problems and Methods for Their Solution [in Russian], Izd. Naukova Dumka, Kiev (1966).

    Google Scholar 

  3. V. V. Shkurba, “Ordering problems,” Kibernetika, No. 2 (1967).

  4. S. E. Oskolkova and I. O. Oskolkov, “Application of heuristic methods to the solution of scheduling problems (survey),” Avtomat. i Telemekhan., No. 2 (1968).

  5. M. Hall, Combinatorial Theory, Blaisdell, Waltham, Mass. (1967).

    Google Scholar 

Download references

Authors

Additional information

Translated from Kibernetika, No. 6, pp. 95–97, November–December, 1971.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fishbein, S.M. Probabilistic approach to the solution of the priority problem. Cybern Syst Anal 7, 1050–1053 (1971). https://doi.org/10.1007/BF01068834

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation