Skip to main content
SpringerLink
Log in

Effective assignment algorithm for continuous two-stage activities in loading and transportation management

  • Published:
Cybernetics and Systems Analysis 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

References

  1. E. G. Kaufmann (ed.), Theory of Schedules and Computers [Russian translation], Nauka, [Moscow (1984).

    Google Scholar 

  2. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ (1982).

    Google Scholar 

  3. A. V. Panishev and S. N. Levchenko, “A scheduling problem for multiprocessor systems,” Kibernetika, No. 2, 127 (1988).

Download references

Authors
  1. A. V. Panishev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. G. Zhuravok
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from kibernetika i Sistemnyi Analiz, No. 1, pp 99–107, January–February, 1997.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Panishev, A.V., Zhuravok, A.G. Effective assignment algorithm for continuous two-stage activities in loading and transportation management. Cybern Syst Anal 33, 77–84 (1997). https://doi.org/10.1007/BF02665944

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation