Skip to main content
SpringerLink
Log in

Number of rectangles of unit width sufficient for packing given rectangles

  • 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. E. G. Coffman, I. Y.-T. Leung, and D. Slutz, “On the optimality of fast heuristics for scheduling and storage allocation problems,” Found. Contr. Eng.,3, No. 4, 161–169 (1978).

    Google Scholar 

  2. É. V. Evreinov and V. G. Khoroshevskii, Uniform Calculating Systems [in Russian], Nauka, Novosibirsk (1978).

    Google Scholar 

  3. L. V. Kantorovich and V. A. Zalgaller, Rational Disposal of Industrial Materials [in Russian], Nauka, Novosibirsk (1971).

    Google Scholar 

  4. V. V. Taft, “Model of the distribution of resources of the working field of a homogeneous calculating system,” Avtomat. Vychisl. Tekh., No. 5, 82–83 (1977).

    Google Scholar 

  5. O. B. Makarevich, É. M. Saak, and A. G. Chefranov, “Model of a functioning homogeneous calculating system under conditions of package processing of complex problems,” Elektron. Modelirovanie, No. 5, 22–27 (1980).

    Google Scholar 

  6. M. Hofri, “Two-dimensional packing — expected performance of simple level algorithms,” Inf. Control,45, No. 1, 1–17 (1980).

    Google Scholar 

  7. V. Yu. Bakenbrot and A. G. Chefranov, “Upper limits of scheduling a solution of independent problems of homogeneous calculating systems under package operating conditions,” Avtomat. Telemekh., No. 9, 173–177 (1981).

    Google Scholar 

  8. E. G. Coffman, M. R. Garey, D. S. Johnson, and R. E. Tarjan, “Performance bounds for level-oriented two-dimensional packing algorithms,” SIAM J. Comput.,9, No. 4, 808–826 (1980).

    Google Scholar 

  9. A. A. Yurchenko, “Algorithm for a dynamically segmented distribution of memory,” Kibernetika, No. 1, 45–54 (1981).

    Google Scholar 

  10. D. S. Johnson, A. Demers, J. D. Ullman, et al., “Worst-case performance bounds for simple one-dimensional packing algorithms,” SIAM J. Compt.,3, No. 2, 299–326 (1974).

    Google Scholar 

  11. V. Yu. Bakenrot, “Effectiveness of an algorithm for constructing a scheduling,” Kibernetika, No. 1, 140–143 (1980).

    Google Scholar 

  12. O. H. Ibarra and C. E. Kim, “Heuristic algorithms for scheduling independent tasks on nonidentical processors,” J. ACM,24, No. 2, 280–289 (1977).

    Google Scholar 

  13. E. G. Coffman, M. R. Garey, and D. S. Johnson, “An application of bin-packing to multiprocessor scheduling,” SIAM J. Comput.,7, No. 1, 1–17 (1978).

    Google Scholar 

Download references

Authors
  1. V. Yu. Bakenrot
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. O. B. Makarevich
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. G. Chefranov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 1, pp. 26–27, 32, January–February, 1984.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bakenrot, V.Y., Makarevich, O.B. & Chefranov, A.G. Number of rectangles of unit width sufficient for packing given rectangles. Cybern Syst Anal 20, 38–41 (1984). https://doi.org/10.1007/BF01068866

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation