|
|
|
|
Список литературы
|
|
| |
| 1. |
Baker B. S., Coffman E. J., Rivest R. L., “Orthogonal packings in two dimensions”, SIAM J. Comput., 9 (1980), 846–855    |
| 2. |
Kenyon C., Remila E., “A near optimal solution to a two-dimensional cutting stock problem”, Math. Oper. Research
2000, 25, 645–656 |
| 3. |
Baker B. S., Brown D. J., Katseff H. P., “A 5/4 algorithm for two-dimensional packing”, J. Algorithms, 2 (1981), 348–368 |
| 4. |
Brucker P., Scheduling algorithms, Springer, Berlin, 1998 |
| 5. |
Coffman B. J., Garey M. R., Johnson D. S., Tarjan R. E., “Performance bounds for level-oriented two-dimensional packing algorithms”, SIAM J. Comput., 9 (1980), 808–826 |
| 6. |
Drozdowski M., “Scheduling multiprocessor tasks—an overview”, European J. Oper. Research, 94 (1996), 215–230 |
| 7. |
Foster, Kesselman C., The Grid: Blueprint for a future computing infrastructure, Morgan Kaufmann, San Francisco, 1999 |
| 8. |
Coffman E. G., Jr., Garey M. R., Johnson D. S., “Approximation algorithms for Bin-packing—An updated survey”, Algorithm design for computer system design, Springer, Berlin, 1984, 49–106 |
