论文信息 - Scheduling of the arrays of incomparable requests in the GRID systems - 字舞流文

Scheduling of the arrays of incomparable requests in the GRID systems

Andrey Saak | Vladimir Kureichik

[1] Ronald L. Rivest,et al. Orthogonal Packings in Two Dimensions , 1980, SIAM J. Comput..

[2] Klaus Jansen,et al. Improved approximation algorithms for scheduling parallel jobs on identical clusters , 2015, Theor. Comput. Sci..

[3] Klaus Jansen,et al. Rectangle packing with one-dimensional resource augmentation , 2009, Discret. Optim..

[4] Klaus Jansen,et al. A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability , 2009, ISAAC.

[5] Michele Monaci,et al. Models and algorithms for packing rectangles into the smallest square , 2015, Comput. Oper. Res..

[6] Jacek Blazewicz,et al. Scheduling Independent 2-Processor Tasks to Minimize Schedule Length , 1984, Inf. Process. Lett..

[7] Jan H. van Vuuren,et al. New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems , 2010, Eur. J. Oper. Res..

[8] Richard E. Korf,et al. Optimal Rectangle Packing: An Absolute Placement Approach , 2014, J. Artif. Intell. Res..