Pages that link to "Item:Q4261219"
From MaRDI portal
The following pages link to Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem (Q4261219):
Displaying 5 items.
- Optimal sequencing of a set of positive numbers with the variance of the sequence's partial sums maximized (Q360482) (← links)
- Sequencing jobs with random processing times to minimize weighted completion time variance (Q1374437) (← links)
- An almost exact solution to the min completion time variance in a single machine (Q2239979) (← links)
- A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION (Q3013563) (← links)
- Minimization of expected variance of completion times on single machine for stochastic jobs (Q4346869) (← links)
