Pages that link to "Item:Q733521"
From MaRDI portal
The following pages link to Completion time variance minimization in single machine and multi-machine systems (Q733521):
Displaying 13 items.
- Minimizing flow time variance in a single machine system using genetic algorithms (Q1310012) (← links)
- On the flexibility of a decision theory-based heuristic for single machine scheduling (Q1628046) (← links)
- Scheduling deteriorating jobs with a learning effect on unrelated parallel machines (Q1634126) (← links)
- Completion time variance minimisation on two identical parallel processors (Q1652377) (← 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)
- Hierarchical minimization of completion time variance and makespan in jobshops (Q2496030) (← links)
- Minimising variance of job completion times in a single machine (Q2627247) (← links)
- Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems (Q3812024) (← links)
- On the Minimization of Completion Time Variance with a Bicriteria Extension (Q4032593) (← links)
- Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem (Q4261219) (← links)
- Minimizing the Flow-time Variance in Single-machine Systems (Q5202822) (← links)
