105 citations to 10.1016/j.orl.2004.05.004 (Crossref Cited-By Service)
  1. Jan Clemens Gehrke, Klaus Jansen, Stefan E. J. Kraft, Jakob Schikowski, “A PTAS for Scheduling Unrelated Machines of Few Different Types”, Int. J. Found. Comput. Sci., 29, № 04, 2018, 591  crossref
  2. Hans Raj Tiwary, Victor Verdugo, Andreas Wiese, “On the extension complexity of scheduling polytopes”, Operations Research Letters, 48, № 4, 2020, 472  crossref
  3. Nirwan Ansari, Jingjing Zhang, Media Access Control and Resource Allocation, 2013, 75  crossref
  4. Hanna Furmańczyk, Tytus Pikies, Inka Sokołowska, Krzysztof Turowski, “Approximation algorithms for job scheduling with block-type conflict graphs”, Computers & Operations Research, 166, 2024, 106606  crossref
  5. Klaus Jansen, Kati Land, Marten Maack, “Estimating the Makespan of the Two-Valued Restricted Assignment Problem”, Algorithmica, 80, № 4, 2018, 1357  crossref
  6. Raphael Bleuse, Safia Kedad‐Sidhoum, Florence Monna, Grégory Mounié, Denis Trystram, “Scheduling independent tasks on multi‐cores with GPU accelerators”, Concurrency and Computation, 27, № 6, 2015, 1625  crossref
  7. Shan Wang, Huiqiao Su, Guohua Wan, “Resource-constrained machine scheduling with machine eligibility restriction and its applications to surgical operations scheduling”, J Comb Optim, 30, № 4, 2015, 982  crossref
  8. Zichuan Xu, Yuexin Fu, Qiufen Xia, Hao Li, IEEE INFOCOM 2023 - IEEE Conference on Computer Communications, 2023, 1  crossref
  9. Luis Fanjul-Peyro, Rubén Ruiz, “Size-reduction heuristics for the unrelated parallel machines scheduling problem”, Computers & Operations Research, 38, № 1, 2011, 301  crossref
  10. Kilian Grage, Klaus Jansen, Kim-Manuel Klein, The 31st ACM Symposium on Parallelism in Algorithms and Architectures, 2019, 135  crossref
Предыдущая
1
4
5
6
7
8
9
10
11
Следующая