Geodesic
On comparison of the strip packing problem with a~certain project scheduling problem
Diskretnyj analiz i issledovanie operacij, Tome 15 (2008) no. 4, pp. 57-73

Voir la notice de l'article provenant de la source Math-Net.Ru

Comparison of some particular case of the resource-constrained project scheduling problem with the strip packing problem is performed. The upper bound for the optima relation of these problems is improved. An example with the optima 5 and 4 and the strip width 8 is constructed. It is shown that this example is minimal, i.e., there exist no example with optima 5 and 4 and with less width of the strip. Illustr. 11, bibl. 9.
Keywords: combinatorial optimization, project scheduling, strip packing. 
@article{DA_2008_15_4_a4,
     author = {I. A. Rykov},
     title = {On comparison of the strip packing problem with a~certain project scheduling problem},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {57--73},
     publisher = {mathdoc},
     volume = {15},
     number = {4},
     year = {2008},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2008_15_4_a4/}
}
TY  - JOUR
AU  - I. A. Rykov
TI  - On comparison of the strip packing problem with a~certain project scheduling problem
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2008
SP  - 57
EP  - 73
VL  - 15
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2008_15_4_a4/
LA  - ru
ID  - DA_2008_15_4_a4
ER  - 
%0 Journal Article
%A I. A. Rykov
%T On comparison of the strip packing problem with a~certain project scheduling problem
%J Diskretnyj analiz i issledovanie operacij
%D 2008
%P 57-73
%V 15
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2008_15_4_a4/
%G ru
%F DA_2008_15_4_a4
I. A. Rykov. On comparison of the strip packing problem with a~certain project scheduling problem. Diskretnyj analiz i issledovanie operacij, Tome 15 (2008) no. 4, pp. 57-73. http://geodesic.mathdoc.fr/item/DA_2008_15_4_a4/