Skip to main content
SpringerLink
Log in

Sequencing functions and optimizations on permutations of a partially ordered set

  • 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. V. Ya. Burdyuk and V. N. Reva, “On the method of optimizing functionals of permutations under constraints,” Kibernetika, No. 2, 99–103 (1980).

    Google Scholar 

  2. Ya. M. Shafranskii, Minimization of Priority Generating Functions on Permutations of Elements of Partially Ordered Sets [in Russian], Abstract of Thesis, Minsk (1981).

  3. V. S. Tanaev and V. V. Shkurba, An Introduction to Scheduling Theory [in Russian], Nauka, Moscow (1975).

    Google Scholar 

  4. M. Sh. Levin, “Effective solution of some problems in theory of scheduling on networks,” Kibernetika, No. 1, 131–135 (1980).

    Google Scholar 

  5. E. I. Lawler, “Optimal sequencing constraints,” Math. Cent. Afd. Math. Beslisk. BW, No. 54, 1–15, (1975).

    Google Scholar 

Download references

Authors
  1. V. N. Reva
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3, pp. 49–52, May–June, 1985.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Reva, V.N. Sequencing functions and optimizations on permutations of a partially ordered set. Cybern Syst Anal 21, 334–338 (1985). https://doi.org/10.1007/BF01078828

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation