104 citations to 10.1016/j.orl.2004.05.004 (Crossref Cited-By Service)
  1. Ola Svensson, “Santa Claus Schedules Jobs on Unrelated Machines”, SIAM J. Comput., 41, no. 5, 2012, 1318  crossref
  2. Safia Kedad-Sidhoum, Florence Monna, Grégory Mounié, Denis Trystram, 8374, Euro-Par 2013: Parallel Processing Workshops, 2014, 228  crossref
  3. Nodari Vakhania, Frank Werner, “Polynomial algorithms for scheduling jobs with two processing times on unrelated machines”, IFAC Proceedings Volumes, 45, no. 6, 2012, 93  crossref
  4. Tomáš Ebenlendr, Marek Krčál, Jiří Sgall, “Graph Balancing: A Special Case of Scheduling Unrelated Parallel Machines”, Algorithmica, 68, no. 1, 2014, 62  crossref
  5. Raphael Bleuse, Sascha Hunold, Safia Kedad-Sidhoum, Florence Monna, Gregory Mounie, Denis Trystram, “Scheduling Independent Moldable Tasks on Multi-Cores with GPUs”, IEEE Trans. Parallel Distrib. Syst., 28, no. 9, 2017, 2689  crossref
  6. Nirwan Ansari, Jingjing Zhang, Media Access Control and Resource Allocation, 2013, 53  crossref
  7. Panneerselvam Sivasankaran, Thambu Sornakumar, Ramasamy Panneerselvam, “Design and Comparison of Simulated Annealing Algorithm and GRASP to Minimize Makespan in Single Machine Scheduling with Unrelated Parallel Machines”, IIM, 02, no. 07, 2010, 406  crossref
  8. Olivier Beaumont, Lionel Eyraud‐Dubois, Suraj Kumar, “Fast approximation algorithms for task‐based runtime systems”, Concurrency and Computation, 30, no. 17, 2018, e4502  crossref
  9. Jan Karel Lenstra, Nodari Vakhania, “On the complexity of scheduling unrelated parallel machines with limited preemptions”, Operations Research Letters, 51, no. 2, 2023, 187  crossref
  10. Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo, “A note on “An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs””, Information Processing Letters, 109, no. 12, 2009, 608  crossref
Previous
1
2
3
4
5
11
Next