Skip to main content
SpringerLink
Log in

Placement indicator in minimization problems or permutations

  • 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. S. M. Johnson, “Optimal two-and three-stage production schedules with set-up times included,” in: Cybernetics Collection, New Series [Russian translation], Izd. Mir, No. 1 (1965) [Naval Res. Logist. Quart., 1, 66–68].

  2. R. McNaughton, “Scheduling with deadlines and loss functions” Manag. Science,6, No. 1 (1959).

  3. V. V. Shkurba et al., General Scheduling Problems and Methods, of Their Solution [in Russian], Naukova Dumka, Kiev (1966).

    Google Scholar 

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

    Google Scholar 

  5. W. E. Smith, “Various optimizers for single stage production,” Naval Res. Logist. Quart.,3, No. 1 (1956).

    Google Scholar 

  6. V. S. Tanaev, “Some optimizable functions of single-stage production,” Dokl. Akad. Nauk BelSSSR,9, No. 1 (1965).

    Google Scholar 

  7. É. M. Livshits, “Investigation of some algorithms of discrete optimization,” Author's Abstract of Dissertation, Khar'kov (1969).

  8. V. Ya. Burdyuk and V. V. Shkurba, “Scheduling theory. Problems and solution methods. I,” Kibernetika, No. 1 (1971).

  9. J. G. Rau, “Minimizing a function of permutation of n integers,” Oper. Res., No. 19 (1971).

  10. G. K. Kladov and É. M. Livshits, “Minimization of the sum of penalties in the construction of schedules,” Kibernetika, No. 6 (1968).

  11. V. V. Shkurba, “Regular-sequence intervals in ordering problems,” Kibernetika, No. 2 (1970).

  12. A. D. Glubochanskii, “An extension of the class of penalty functions in the construction of schedules,” Kibernetika, No. 1 (1971).

  13. S. S. Kislitsyn, “Discrete search problems (survey),” Kibernetika., No. 4 (1966).

  14. É. M. Livshits, “Sequence of operations in the manufacture of intricate components,” Avtomat. Telemekh., No. 11 (1968).

  15. M. H. Rothkopf, “Scheduling independent tasks on parallel processors.,” Manag. Sci.,12, No. 5 (1966).

    Google Scholar 

  16. Fuks, Partially Ordered Algebraic Systems [Russian translation], Izd. Mir, Moscow (1965).

    Google Scholar 

  17. É. M. Livshits, “Minimization of the maximal penalty in the problem of a single machine tool,” in: Proceedings of the First Winter School for Mathematical Programming [in Russian], Drogobych (1969).

  18. G. H. Hardy D. E. Littlewood, and G. Polya, Inequalities [Russian translation], IL, Moscow (1948).

    Google Scholar 

  19. M. I. Rubinshtein, “Symmetrical traveling salesman problem,” Avtomat. Telemekh., No. 9 (1971).

Download references

Authors
  1. É. M. Livshits
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika., No. 3, pp. 80–90, May–June, 1975.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Livshits, É.M. Placement indicator in minimization problems or permutations. Cybern Syst Anal 11, 429–440 (1975). https://doi.org/10.1007/BF01069470

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation