The purpose of bin packing is the effective apportionment of smaller elements in the bigger ones. The bin packing is being analysed in managment, computers, mathematics and researches of operations. The quality of the heuristic structural algorithm and time have been analysed in the work (the percent of the used material and the quality of the received waste). The results of the researches show that non-sorted bin packing algorithms cut better than bin packing sorted algorithms but the time of cutting grows longer when the number of finished products grow longer.
| Identifer | oai:union.ndltd.org:LABT_ETD/oai:elaba.lt:LT-eLABa-0001:E.02~2005~D_20050609_143028-57047 |
| Date | 09 June 2005 |
| Creators | Matkevičius, Audrius |
| Contributors | Slivinskas, Vytautas, Dzemyda, Gintautas, Kazlauskas, Kazys, Šaltenis, Vydūnas, Stankevičienė, Eglė, Vilnius Pedagogical University |
| Publisher | Lithuanian Academic Libraries Network (LABT), Vilnius Pedagogical University |
| Source Sets | Lithuanian ETD submission system |
| Language | Lithuanian |
| Detected Language | English |
| Type | Master thesis |
| Format | application/pdf |
| Source | http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2005~D_20050609_143028-57047 |
| Rights | Unrestricted |
Page generated in 0.0019 seconds