Stochastic Makespan Minimization
Stochastic Makespan Minimization is a stochastic scheduling problem that seeks to minimize the expected completion time of the last-executing job in a set of jobs with random processing times, thereby distinguishing it from deterministic makespan minimization by explicitly accounting for uncertainty in job durations.
68
Publications
3.1K
Citations
142
Authors
92
Institutions
Publications per year
2017–2026
12
Parents
68
Stochastic load balancing and related problems
Ashish Goel, Piotr Indyk · 2003 · 162 citations
Management, Industrial Engineering, Operations Management +17
1–5 of 68
142
8
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 142
92
Columbia University
New York, United States
5 h-index
6 publications
571 citations
Georgia Institute of Technology
Atlanta, United States
4 h-index
4 publications
183 citations
Eindhoven University of Technology
Eindhoven, The Netherlands
3 h-index
7 publications
204 citations

Tel Aviv University
Tel Aviv, Israel
2 h-index
2 publications
519 citations
Wuhan University of Technology
Wuhan, China
2 h-index
2 publications
62 citations
North Carolina State University
Raleigh, United States
2 h-index
4 publications
86 citations
Dalian University of Technology
Dalian, China
2 h-index
4 publications
65 citations
Academy of Mathematics and Systems Science
Beijing, China
2 h-index
8 publications
150 citations
1–8 of 92
6 publications · 724 citations
6
h-index
6 publications · 174 citations
6
h-index
5 publications · 337 citations
5
h-index
OR · 3 publications · 131 citations
3
h-index
JOS · 2 publications · 119 citations
2
h-index
1–5