Ládapakolások átpakolással
In contrast to on-line bin packing, semi-on-line bin-packing allows the algorithm to carry out extra operations, in addition to the packing of the actual element, in each step of the process. These extra operations might include at least one of the following operations: repacking, reordering or buff...
Elmentve itt :
| Szerzők: | |
|---|---|
| Testületi szerző: | |
| Dokumentumtípus: | Könyv része |
| Megjelent: |
2009
|
| Sorozat: | Tudományos és művészeti műhelymunkák: új utakon a Pedagógusképző Kar című konferencia előadásai
|
| Kulcsszavak: | Algoritmus |
| Online Access: | http://acta.bibl.u-szeged.hu/64234 |
| Tartalmi kivonat: | In contrast to on-line bin packing, semi-on-line bin-packing allows the algorithm to carry out extra operations, in addition to the packing of the actual element, in each step of the process. These extra operations might include at least one of the following operations: repacking, reordering or buffering. This paper defines and analyses a semi-on-line bin-packing problem, where repacking is allowed, but only for a restricted number of elements. We provide lower and upper bounds for the problem, and lower bounds for some special cases of the problem. The lower bounds also apply to some related problems. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 364-369 |
| ISBN: | 978-963-9927-15-5 |