Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

A branch-and-bound algorithm for the solution of two network scheduling problems

  • 13 Accesses

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

Literature Cited

  1. 1.

    R. Karp, “Reducibility of combinatorial problems,” [Russian translation] in: Kiberneticheskii Sbornik, New Ser., No. 12, 16–38 (1975).

  2. 2.

    M. R. Garay and D. S. Johnson, “Complexity results for multiprocessor scheduling under resource constraints,” SIAM Comput.,4, No. 4, 397–411 (1975).

  3. 3.

    J. D. Ullman, “NP-complete scheduling problems,” J. Comput. Syst. Sci.,10, No. 3, 384–393 (1975).

  4. 4.

    A. M. Geoffrion and R. E. Marsten, “Integer programming, algorithms: a framework and state-of-the-art survey,” Manag. Sci.,18, No. 9, 465–491 (1972).

  5. 5.

    E. B. Fernandez and T. Lang, “Computation of lower bounds for multi-processor schedules,” IBM J. Res. Dev.,19, No. 5, 435–444 (1975).

  6. 6.

    A. I. Kulsa, “Comparison of lower bounds on the length of deterministic multiprocessor schedules,” Kibernetika, No. 5, 87–90 (1979).

  7. 7.

    F. I. Andon and B. E. Polyachenko, “On a data processing technology for MIS,” Kibernetika, No. 2, 65–69 (1980).

Download references

Additional information

Translated from Kibernetika, No. 1, pp. 73–76, January–February, 1984.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Kuksa, A.I., Polyachenko, B.E. A branch-and-bound algorithm for the solution of two network scheduling problems. Cybern Syst Anal 20, 112–116 (1984). https://doi.org/10.1007/BF01068876

Download citation


  • Operating System
  • Artificial Intelligence
  • Schedule Problem
  • System Theory
  • Network Schedule