Pages that link to "Item:Q4346869"
From MaRDI portal
The following pages link to Minimization of expected variance of completion times on single machine for stochastic jobs (Q4346869):
Displaying 8 items.
- \(V\)-shape property for job sequences that minimize the expected completion time variance (Q1278193) (← links)
- Bounds for the position of the smallest job in completion time variance minimization (Q1296376) (← links)
- Pseudopolynomial algorithms for CTV minimization in single machine scheduling (Q1373152) (← links)
- Sequencing jobs with random processing times to minimize weighted completion time variance (Q1374437) (← links)
- Minimising variance of job completion times in a single machine (Q2627247) (← links)
- A single-machine scheduling problem with random processing times (Q3734154) (← links)
- Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem (Q4261219) (← links)
- On the completion time of a job processed on an unreliable machine (Q5949535) (← links)