Skip to main content
Log in

Application of a combinatorial method for solving the problem of constructing a time table

  • Brief Communications
  • 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.

References

  1. J. Riordan, An Introduction to Combinatorial Analysis [Russian translation], Moscow, 1963.

  2. Appleby, Blake, and Newman, “Techniques for producing school timerables on a computer and their application to other scheduling problems, Computer Journal, vol. 3, no. 4, 237–245.

  3. V. F. Maksimenko and T. M. Lyashenko, “An algorithm for constructing some queueing schemes,” collection: Computational Mathematics and Techniques [in Russian], AN UkrSSR, Kiev, 1963.

    Google Scholar 

  4. S. I. Novoselov, Special Course in Elementary Algebra [in Russian], izd-vo Vysshaya shkola, Moscow, 1965.

    Google Scholar 

  5. P. Stahlknecht, “On the possibility of constructing school timetables by means of a computer,” Elektron. Datenverarb., no. 2, pp. 85–91, 1964.

    Google Scholar 

  6. R. Gunzenhauser and W. Junginger, “Über eine Methode zur Erstelung von Schulstundenplänen mit Hilfe einer Ziffernerechenanlage,” Z. mod Rechentechn, und Automat., vol. 11, no. 3, pp. 100–104, 1964.

    Google Scholar 

Download references

Authors

Additional information

Kibernetika, Vol. 3, No. 4, pp. 98–100, 1967.

NII PMK MVSSO, RSFSR

Rights and permissions

Reprints and permissions

About this article

Cite this article

Portugal, V.M. Application of a combinatorial method for solving the problem of constructing a time table. Cybern Syst Anal 3, 81–82 (1967). https://doi.org/10.1007/BF01071713

Download citation

  • Issue Date:

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

Keywords

Navigation