Pages that link to "Item:Q1413810"
From MaRDI portal
The following pages link to A branch and bound algorithm to minimize completion time variance on a single processor. (Q1413810):
Displaying 17 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)
- Completion time variance minimization on a single machine is difficult (Q1317023) (← links)
- A solvable case of the variance minimization problem (Q1324501) (← links)
- Pseudopolynomial algorithms for CTV minimization in single machine scheduling (Q1373152) (← 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)
- Permutation polyhedra and minimisation of the variance of completion times on a single machine (Q1850996) (← links)
- A branch and price algorithm for single-machine completion time variance (Q2003576) (← 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 branch and bound algorithm for the response time variability problem (Q2434314) (← links)
- Hierarchical minimization of completion time variance and makespan in jobshops (Q2496030) (← links)
- A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION (Q3013563) (← links)
- Time-flexible min completion time variance in a single machine by quadratic programming (Q6090146) (← links)
