Pages that link to "Item:Q1183389"
From MaRDI portal
The following pages link to Proof of a conjecture of Schrage about the completion time variance problem (Q1183389):
Displaying 21 items.
- Optimal sequencing of a set of positive numbers with the variance of the sequence's partial sums maximized (Q360482) (← links)
- A lower bound for weighted completion time variance (Q613431) (← links)
- Completion time variance minimization in single machine and multi-machine systems (Q733521) (← links)
- Job scheduling methods for reducing waiting time variance (Q878584) (← links)
- Mimimization of agreeably weighted variance in single machine systems (Q1127158) (← links)
- Scheduling about a given common due date to minimize mean squared deviation of completion times (Q1266598) (← links)
- A tight lower bound for the completion time variance problem (Q1268251) (← links)
- Bounds for the position of the smallest job in completion time variance minimization (Q1296376) (← links)
- Completion time variance minimization on a single machine is difficult (Q1317023) (← links)
- A quadratic integer programming method for minimizing the mean squared deviation of completion times (Q1342085) (← links)
- Pseudopolynomial algorithms for CTV minimization in single machine scheduling (Q1373152) (← links)
- Multi-machine scheduling with variance minimization (Q1392562) (← links)
- A branch and bound algorithm to minimize completion time variance on a single processor. (Q1413810) (← links)
- Fast fully polynomial approximation schemes for minimizing completion time variance (Q1600838) (← links)
- Completion time variance minimisation on two identical parallel processors (Q1652377) (← links)
- An efficient local search for minimizing completion time variance in permutation flow shops (Q1762072) (← links)
- An almost exact solution to the min completion time variance in a single machine (Q2239979) (← links)
- An exact algorithm to minimize mean squared deviation of job completion times about a common due date (Q2356179) (← links)
- A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION (Q3013563) (← links)
- Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem (Q4261219) (← links)
- Time-flexible min completion time variance in a single machine by quadratic programming (Q6090146) (← links)
