Single-machine Stochastic Scheduling
Single-Machine Stochastic Scheduling is a stochastic scheduling model in which a single machine processes a set of jobs whose processing times, release times, or other parameters are random variables, and the objective is to determine an optimal sequence or policy that minimizes a given performance measure in expectation or with high probability.
68
Publications
2.4K
Citations
116
Authors
82
Institutions
Publications per year
2017–2026
4
Parents
68
1–5 of 68
116
8
h-index
7
h-index
7
h-index
5
h-index
4
h-index
1–5 of 116
82

Newcastle University
Newcastle upon Tyne, United Kingdom
8 h-index
11 publications
213 citations
Shenyang Aerospace University
Shenyang, China
7 h-index
11 publications
496 citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
7 h-index
8 publications
223 citations

Hong Kong Polytechnic University
Hong Kong, Hong Kong
6 h-index
6 publications
165 citations
University of California, Berkeley
Berkeley, United States
4 h-index
5 publications
234 citations
Clemson University
Clemson, United States
3 h-index
4 publications
158 citations
Engineering Systems (United States)
Omaha, United States
3 h-index
4 publications
210 citations
Kuwait University
Kuwait City, Kuwait
3 h-index
3 publications
160 citations
1–8 of 82
9 publications · 358 citations
9
h-index
6 publications · 279 citations
6
h-index
JOS · 3 publications · 93 citations
3
h-index
3 publications · 72 citations
3
h-index
3 publications · 112 citations
3
h-index
1–5