Skip to main content
SpringerLink
Log in

Regular g-orderings and smith functions

  • 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. G. H. Hardy, D. E. Littlewood, and G. Polya, Inequalities, Cambridge University Press, Cambridge (1952).

    Google Scholar 

  2. S. M. Johnson, “Optimal two- and three-stage production schedules with setup times included,” Naval Research Logical Quarterly,1, No. 1 (1954).

    Google Scholar 

  3. S. M. Johnson, “Optimal scheduling for two-and three-stage processes,” in: Cybernetics Collection. New Series [Russian translation], Mir, Moscow (1965).

    Google Scholar 

  4. W. E. Smith, “Various optimizers for single-stage production,” Naval Research Logical Quarterly,3, Nos. 1 and 2 (1956).

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

  6. V. S. Tanaev, “On one problem of scheduling theory,” Izv. Akad. Nauk BelSSR, No. 4 (1964).

  7. V. S. Tanaev, “On one class of problems of scheduling theory,” in: Proceedings of the Third All-Union Conference on Automatic Control. Engineering Cybernetics, 1965. Production Control [in Russian], Nauka, Moscow (1967).

    Google Scholar 

  8. V. V. Shkurba, “Intercals of alternation in ordering problems,” Kibernetika (1970).

  9. C. Berge, The Theory of Graphs and Its Applications, Wiley, New York (1962).

    Google Scholar 

  10. S. E. Elmaghraby, “A graph-theoretical interpretation of the sufficiency conditions for the contiguous-binaryswitching CCBS) rule,” Naval Research Logical Quarterly,18, No. 3 (1971).

  11. V. V. Shkurba et al., Problems of Calendar Planning and Methods of Their Solution [in Russian], Naukova Dumka, Kiev (1966).

    Google Scholar 

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

    Google Scholar 

  13. A. A. Voronov, Operations Research and Control [in Russian], Nauka, Moscow (1970).

    Google Scholar 

  14. M. S. Bakshi and S. R. Arora, “The sequencing problem,” Management Science,16, No. 4 (1962).

    Google Scholar 

  15. O. Ore, Theory of Graphs, American Mathematical Society, Providence, Rhode Island (1962).

    Google Scholar 

  16. A. Kaufman and G. Desbazielly, Critical Path Method, Gordon & Breech Science Pub., New York (1969).

    Google Scholar 

  17. S. I. Zukhovitskii and I. A. Radehik, Mathematical Methods of Network Planning [in Russian], Nauka, Moscow (1965).

    Google Scholar 

  18. V. Ya. Burdyuk, “Construction of all optimal permutations for two-machine problems,” in: Use of Mathematical Methods in the Solution of Production and Economics Problems [in Russian], Izd. Dnepropetrovsk. Gos. Univ. (1970).

  19. H. Okamura and J. Yamashina, “Establishment of linear sequences,” Mem. Fac. Engng. Kyoto Univ.,31, No. 3 (1967).

    Google Scholar 

Download references

Authors
  1. V. Ya. Burdyuk
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 2, pp. 31–39, March–April, 1975.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Burdyuk, V.Y. Regular g-orderings and smith functions. Cybern Syst Anal 11, 208–217 (1975). https://doi.org/10.1007/BF01069859

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation