Pages that link to "Item:Q1392562"
From MaRDI portal
The following pages link to Multi-machine scheduling with variance minimization (Q1392562):
Displaying 17 items.
- Completion time variance minimization in single machine and multi-machine systems (Q733521) (← links)
- Job scheduling methods for reducing waiting time variance (Q878584) (← links)
- Scheduling on machines with variable service rates (Q1094326) (← links)
- Mimimization of agreeably weighted variance in single machine systems (Q1127158) (← links)
- Proof of a conjecture of Schrage about the completion time variance problem (Q1183389) (← links)
- Fast fully polynomial approximation schemes for minimizing completion time variance (Q1600838) (← links)
- Completion time variance minimisation on two identical parallel processors (Q1652377) (← links)
- New results on the completion time variance minimization (Q1805454) (← 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)
- A note on minimizing the sum of squares of machine completion times on two identical parallel machines (Q2358184) (← links)
- Hierarchical minimization of completion time variance and makespan in jobshops (Q2496030) (← links)
- Single- and multiple-processor models for minimizing completion time variance (Q3735434) (← links)
- On the Minimization of Completion Time Variance with a Bicriteria Extension (Q4032593) (← links)
- Minimizing mean absolute deviation of job completion times from the mean completion time (Q4526923) (← links)
- Minimizing the Flow-time Variance in Single-machine Systems (Q5202822) (← links)
- Note: ?Simultaneous optimization of efficiency and performance balance measures in single-machine scheduling problems? (Q5688024) (← links)
