Scheduling Approximation
Scheduling Approximation is a computational framework within approximation algorithms that specifically addresses the allocation of tasks to resources over time by providing near-optimal solutions with provable performance guarantees relative to an ideal optimal schedule.
457
Publications
22.1K
Citations
795
Authors
423
Institutions
Publications per year
2017–2026
55
Parents
457
Algorithms for Scheduling Independent Tasks
Sartaj Sahni · Journal of the ACM · 1976 · 593 citations · Full text
1–5 of 457
795
15
h-index
14
h-index
12
h-index
11
h-index
11
h-index
1–5 of 795
423
Technion – Israel Institute of Technology
Haifa, Israel
14 h-index
26 publications
1.1K citations

Christian-Albrechts-Universität zu Kiel
Kiel, Germany
13 h-index
19 publications
576 citations
Graz University of Technology
Graz, Austria
12 h-index
14 publications
1.1K citations
Eindhoven University of Technology
Eindhoven, The Netherlands
12 h-index
17 publications
672 citations

Centre National de la Recherche Scientifique
Paris, France
12 h-index
27 publications
741 citations
Technische Universität Berlin
Berlin, Germany
11 h-index
14 publications
1.5K citations
University of Graz
Graz, Austria
11 h-index
11 publications
334 citations

Université Grenoble Alpes
Saint-Martin-d'Hères, France
9 h-index
18 publications
348 citations
1–8 of 423
19 publications · 2.4K citations
18
h-index
23 publications · 860 citations
18
h-index
JOS · 22 publications · 970 citations
16
h-index
15 publications · 1.1K citations
13
h-index
12 publications · 406 citations
12
h-index
1–5