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/

[1] Gimadi E. Kh., “O nekotorykh matematicheskikh modelyakh i metodakh planirovaniya krupnomasshtabnykh proektov”, Modeli i metody optimizatsii, Tr. AN SSSR. Sib. Otd-nie. In-t matematiki, 10, Nauka, Novosibirsk, 1988, 89–115 | MR

[2] Gimadi E. Kh., Zalyubovskii V. V., Sharygin P. I., “Zadacha upakovki v polosu: asimptoticheski tochnyi podkhod”, Izv. vuzov, 1997, no. 12, 37–49

[3] Sharygin P. I., “Otsenki priblizhënnogo resheniya odnoi zadachi kalendarnogo planirovaniya”, Diskret. analiz i issled. operatsii, 2:1 (1995), 57–67 | MR | Zbl

[4] Baker B. S., Brown D. J., Kartseff H. P., “A 5/4 algorithm for two-dimensional packing”, J. Algorithms, 1981, no. 2, 348–368 | DOI | MR | Zbl

[5] Coffman E. G., Garey M. K., Johnson D. S., Tarjan K. E., “Performance bounds for level-oriented two-dimensional packing algorithms”, SIAM J. Computing, 9:4 (1980), 808–826 | DOI | MR | Zbl

[6] Garey M. R., Graham R. L., Johnson D. S., Yao A. C.-C., “Resource constrained scheduling as generalized bin packing”, J. Combinatorial Theory. Ser A, 21:3 (1976), 251–298 | DOI | MR

[7] Hartmann S., “Packing problems and project scheduling models: an integrating perspective”, J. Operational Research Society, 51:9 (2000), 1083–1092 | MR | Zbl

[8] Johnson D. S., Demers A., Ullman J. D., Garey M. R., Graham R. L., “Worst-case performance bounds for simple one-dimensional packing algorithms”, SIAM J. Computing, 3:4 (1974), 299–325 | DOI | MR

[9] Kolisch R., Hartmann S., “Experimental investigation of heuristics for resource-constrained project scheduling: an update”, European J. Operational Research, 174:1 (2006), 23–37 | DOI | Zbl