Journal of Soviet Mathematics

, Volume 41, Issue 4, pp 1110–1116 | Cite as

Processes with alternating activities

  • R. G. Sadykov


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature cited

  1. 1.
    Yoneda Keizo, “A linear programming of a special type and its application,” J. Oper Res. Soc. Jpn.,4, No. 1, 47–48 (1961).Google Scholar
  2. 2.
    V. S. Aizenshtat, “Multioperator cyclic processes,” Dokl. Akad. Nauk BSSR,7, No. 1, 224–227 (1963).Google Scholar
  3. 3.
    Gh. Mihoc and E. Balas, “Problems orarelor optime,” Studii Sincercetary Mat. Acad, RPR,17, No. 4, 477–484 (1965).Google Scholar
  4. 4.
    A. Sh. Blokh and V. S. Tanaev, “Multioperator processes,” Izv. Akad. Nauk BSSR, Ser. Fiz. Mat. Nauk, No. 2, 5–11 (1966).Google Scholar
  5. 5.
    V. N. Shevchenko, “The optimal scheduling problem with n machines,” Probl. Kibern., No. 18, 129–146 (1967).Google Scholar
  6. 6.
    V. A. Talanov, “The setup problem.” Uch. Zap. Gor'kovskogo Univ., No. 105, 9–12 (1969).Google Scholar
  7. 7.
    N. I. Veduta and V. A. Safronenko, “A mathematical model of short-term planning of mass production,” Ekon. Mat. Metody,6, No. 6, 894–909 (1970).Google Scholar
  8. 8.
    M. Segal, “The operator-scheduling problem. A network flow approach,” Oper. Res.,22, No. 4, 808–823 (1974).Google Scholar
  9. 9.
    A. M. Épshtein, Trudy Gor'kovskogo Politekh. Inst.,30, No. 9, 23–27 (1974).Google Scholar
  10. 10.
    S. K. Khramshin and V. M. Chentsov, “On one problem of organization of the computational process in a MIS,” Izv. Akad. Nauk SSSR, Tekh. Kibern., No. 4 (1975).Google Scholar
  11. 11.
    S. S. Veniaminov and G. A. Sokolov, “Optimal scheduling of jobs for one class of complex systems,” Izv. Akad. Nauk SSSR, Tekh. Kibern., No. 5, 74–77 (1975).Google Scholar
  12. 12.
    L. D. Vishnevskii, “On one problem of short-term planning,” Kibernetika, No. 3, 115–118 (1976).Google Scholar
  13. 13.
    R. D. Armstrong and Sinha Prabhakant, “The cyclic separation scheduling problem,” Naval Res. Log. Quart.,24, No. 4, 609–618 (1977).Google Scholar
  14. 14.
    H. E. Miller, W. P. Pierskalla, and G. J. Roth, “Nurse scheduling using mathematical Programming,” Oper. Res.,24, No. 5, 857–870 (1976).Google Scholar
  15. 15.
    M. I. Lugachev, “An assignment and sequencing problem in short-term production planning,” Ekon. Mat. Metody,15, No. 1, 173–183 (1979).Google Scholar
  16. 16.
    J. J. Bartholdi, J. B. Orlin, and H. D. Ratliff, “Cyclic scheduling via integer programs with circular ones,” Oper. Res.,28, No. 5, 1074–1085 (1980).Google Scholar
  17. 17.
    G. Laporte, Y. Nobert, and J. Biron, “Rotating schedules,” Eur. J. Oper. Res.,4, No. 1, 24–30 (1980).Google Scholar
  18. 18.
    K. V. Shakhbazyan, “Structured schedules in scheduling problems,” J. Sov. Math.,22, No. 2 (1983).Google Scholar
  19. 19.
    A. A. Babaev and B. N. Druganov, “The branch-and-bound method in the weekly scheduling problem,” Kibernetika, No. 1, 63–67 (1981).Google Scholar
  20. 20.
    A. A. Korbut, “The application of operations research methods in agricultural economics,” Proc. of a Scientific Conf. on Application of Mathematical Methods in Economics of Research and Planning [in Russian], Vol. 6, AN SSSR (1961), pp. 92–109.Google Scholar
  21. 21.
    R. Conway, W. Maxwell, and L. Miller, Theory of Scheduling [Russian translation], Nauka, Moscow (1975).Google Scholar
  22. 22.
    R. G. Sadykov, “On the solution of one assignment problem,” in: Computational Methods and Computer Software [in Russian], Kazan State Univ. (1979), pp. 88–106.Google Scholar
  23. 23.
    R. G. Sadykov, “The assignment problem with ‘windows’,” in: Computational Methods and Computer Software [in Russian], No. 2, Kazan State Univ. (1980), pp. 128–136.Google Scholar
  24. 24.
    V. S. Tanaev and V. V. Shkurba, An Introduction to Scheduling Theory [in Russian], Nauka, Moscow (1975).Google Scholar

Copyright information

© Plenum Publishing Corporation 1988

Authors and Affiliations

  • R. G. Sadykov

There are no affiliations available

Personalised recommendations