Приближенные алгоритмы упаковки прямоугольников в несколько полос
С. Н. Жук

Эта публикация цитируется в следующих статьяx:

1. Igor Vasilyev, Anton V. Ushakov, Dong Zhang, Jie Ren, “Generalized multiple strip packing problem: Formulations, applications, and solution algorithms”, Computers & Industrial Engineering, 178 (2023), 109096  
2. Lucas Rosa, Danilo Carastan-Santos, Alfredo Goldman, Lecture Notes in Computer Science, 14283, Job Scheduling Strategies for Parallel Processing, 2023, 116  
3. Fangfang Wu, Zhongyi Jiang, Run Zhang, Xiandong Zhang, “Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms”, J Sched, 26:4 (2023), 383  
4. Igor Vasilyev, Anton V. Ushakov, Maria V. Barkova, Dong Zhang, Jie Ren, Juan Chen, Communications in Computer and Information Science, 1476, Mathematical Optimization Theory and Operations Research: Recent Trends, 2021, 284  
5. Д. О. Лазарев, Н. Н. Кузюрин, “Улучшение ранее известной верхней оценки для задачи Multiple Strip Packing и вероятностный анализ алгоритма для большого числа полос”, Труды ИСП РАН, 31:1 (2019), 133–142      
6. Lazarev D.O. Kuzyurin N.N., “On Online Algorithms For Bin, Strip, and Box Packing, and Their Worst-Case and Average-Case Analysis”, Program. Comput. Softw., 45:8 (2019), 448–457        
7. Carastan-Santos D., de Camargo R.Y., Trystram D., Zrigui S., “One Can Only Gain By Replacing Easy Backfilling: a Simple Scheduling Policies Case Study”, 2019 19Th IEEE/Acm International Symposium on Cluster, Cloud and Grid Computing (Ccgrid), IEEE-Acm International Symposium on Cluster Cloud and Grid Computing, IEEE, 2019, 1–10    
8. Sant'Ana L., de Camargo R., Carastan-Santos D., Cordeiro D., “Real-Time Scheduling Policy Selection From Queue and Machine States”, 2019 19Th IEEE/Acm International Symposium on Cluster, Cloud and Grid Computing (Ccgrid), IEEE-Acm International Symposium on Cluster Cloud and Grid Computing, IEEE, 2019, 381–390    
9. Danilo Carastan-Santos, Raphael Y. De Camargo, Denis Trystram, Salah Zrigui, 2019 19th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID), 2019, 1  
10. Klaus Jansen, Malin Rau, Lecture Notes in Computer Science, 11725, Euro-Par 2019: Parallel Processing, 2019, 103  
11. Luis Sant'ana, Danilo Carastan-Santos, Daniel Cordeiro, Raphael De Camargo, 2019 19th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID), 2019, 381  
12. Д. О. Лазарев, Н. Н. Кузюрин, “Об онлайновых алгоритмах для задач упаковки в контейнеры и полосы, их анализе в худшем случае и в среднем”, Труды ИСП РАН, 30:4 (2018), 209–230      
13. Д. О. Лазарев, Н. Н. Кузюрин, “Алгоритм построения расписаний выполнения параллельных задач на группах кластеров с процессорами различной производительности и его анализ в среднем”, Труды ИСП РАН, 30:6 (2018), 105–122      
14. Sant'Ana L.F., Carastan-Santos D., Cordeiro D., de Camargo R.Y., “Analysis of Potential Online Scheduling Improvements By Real-Time Strategy Selection”, 2018 Symposium on High Performance Computing Systems (Wscad 2018), eds. Bianchini C., DeSouza P., DeBarros C., Ferreira R., IEEE, 2018, 1–7    
15. Yu G., Mao Ya., Xiao J., “New upper bounds for online strip packing”, Discret. Optim., 23 (2017), 20–32          
16. Yu G., Mao Ya., Xiao J., “a New Lower Bound For Online Strip Packing”, Eur. J. Oper. Res., 250:3 (2016), 754–759          
17. Ш. И. Галиев, М. С. Лисафина, “Численный метод оптимизации упаковок правильных выпуклых многоугольников”, Ж. вычисл. матем. и матем. физ., 56:8 (2016), 1416–1427      ; Sh. I. Galiev, M. S. Lisafina, “Numerical optimization method for packing regular convex polygons”, Comput. Math. Math. Phys., 56:8 (2016), 1402–1413    
18. Ye D., Zhang G., “Approximate composable truthful mechanism design”, Theor. Comput. Sci., 654:SI (2016), 188–198          
19. Klaus Jansen, Denis Trystram, “Scheduling parallel jobs on heterogeneous platforms”, Electronic Notes in Discrete Mathematics, 55 (2016), 9  
20. Bougeret M., Dutot P.-F., Trystram D., Jansen K., Robenek Ch., “Improved Approximation Algorithms For Scheduling Parallel Jobs on Identical Clusters”, Theor. Comput. Sci., 600 (2015), 70–85          
21. Cohen J., Cordeiro D., Trystram D., “Coordination Mechanisms For Decentralized Parallel Systems”, Concurr. Comput.-Pract. Exp., 27:5 (2015), 1255–1272      
22. Ye D., Zhang G., “Approximate Truthful Mechanism Design For Two-Dimensional Orthogonal Knapsack Problem”, Computing and Combinatorics, Lecture Notes in Computer Science, 9198, eds. Xu D., Du D., Du D., Springer-Verlag Berlin, 2015, 390–401          
23. Pierre-François Dutot, Klaus Jansen, Christina Robenek, Denis Trystram, Lecture Notes in Computer Science, 8097, Euro-Par 2013 Parallel Processing, 2013, 78  
24. Deshi Ye, Lili Mei, Lecture Notes in Computer Science, 7285, Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012, 139  
25. Deshi Ye, Guochuan Zhang, Lecture Notes in Computer Science, 7287, Theory and Applications of Models of Computation, 2012, 225  
26. Marin Bougeret, Pierre-Francois Dutot, Klaus Jansen, Christina Robenek, Denis Trystram, 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum, 2012, 878  
27. Ye D., Han X., Zhang G., “Online multiple-strip packing”, Theoret. Comput. Sci., 412:3 (2011), 233–239          
28. Cohen J., Cordeiro D., Trystram D., Wagner F., “Multi-organization scheduling approximation algorithms”, Concurrency and Computation: Practice and Experience, 23:17 (2011), 2220–2234      
29. Manuel Ramirez-Alcaraz J., Tchernykh A., Yahyapour R., Schwiegelshohn U., Quezada-Pina A., Luis Gonzalez-Garcia J., Hirales-Carbajal A., “Job allocation strategies with user run time estimates for online scheduling in hierarchical grids”, Journal of Grid Computing, 9:1 (2011), 95–116          
30. Daniel Cordeiro, Pierre-Francois Dutot, Gregory Mounié, Denis Trystram, 2011 IEEE International Parallel & Distributed Processing Symposium, 2011, 1177  
31. MARIN BOUGERET, PIERRE-FRANCOIS DUTOT, KLAUS JANSEN, CHRISTINA ROBENEK, DENIS TRYSTRAM, “APPROXIMATION ALGORITHMS FOR MULTIPLE STRIP PACKING AND SCHEDULING PARALLEL JOBS IN PLATFORMS”, Discrete Math. Algorithm. Appl., 03:04 (2011), 553  
32. Marin Bougeret, Pierre Francois Dutot, Klaus Jansen, Christina Robenek, Denis Trystram, Lecture Notes in Computer Science, 6842, Computing and Combinatorics, 2011, 271  
33. Johanne Cohen, Daniel Cordeiro, Denis Trystram, Frederic Wagner, 2011 18th International Conference on High Performance Computing, 2011, 1  
34. Bougeret M., Dutot P.F., Jansen K., Otte Ch., Trystram D., “Approximating the Non-contiguous Multiple Organization Packing Problem”, Theoretical Computer Science, IFIP Advances in Information and Communication Technology, 323, 2010, 316–327          
35. Bougeret M., Dutot P.-F., Jansen K., Otte Ch., Trystram D., “A fast 5/2-approximation algorithm for hierarchical scheduling”, Euro-Par 2010 Parallel Processing, Part I, Lecture Notes in Comput. Sci., 6271, Springer, Berlin, 2010, 157–167      
36. Cohen J., Cordeiro D., Trystram D., Wagner F., “Analysis of multi-organization scheduling algorithms”, Euro-Par 2010 Parallel Processing, Part II, Lecture Notes in Comput. Sci., 6272, Springer, Berlin, 2010, 367–379        
37. Bougeret M., Dutot P.F., Jansen K., Otte Ch., Trystram D., “Approximation algorithms for multiple strip packing”, Approximation and online algorithms, Lecture Notes in Comput. Sci., 5893, Springer, Berlin, 2010, 37–48          
38. Ye D., Han X., Zhang G., “On-line multiple-strip packing”, Combinatorial optimization and applications, 5573, Springer, Berlin, 2009, 155–165          
39. С. Н. Жук, “Об онлайн-алгоритмах упаковки прямоугольников в несколько полос”, Дискрет. матем., 19:4 (2007), 117–131          ; S. N. Zhuk, “On-line algorithms for packing rectangles into several strips”, Discrete Math. Appl., 17:5 (2007), 517–531