Pages that link to "Item:Q5202822"

The following pages link to Minimizing the Flow-time Variance in Single-machine Systems (Q5202822):

Displaying 23 items.

• On discrete optimization with ordering (Q367635) (← 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)
• Single machine scheduling with coefficient of variation minimization (Q1205688) (← links)
• A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions (Q1207198) (← links)
• Scheduling about a given common due date to minimize mean squared deviation of completion times (Q1266598) (← links)
• \(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)
• Minimizing flow time variance in a single machine system using genetic algorithms (Q1310012) (← 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)
• Completion time variance minimisation on two identical parallel processors (Q1652377) (← links)
• Ordered weighted average optimization in multiobjective spanning tree problem (Q1753508) (← links)
• A branch and price algorithm for single-machine completion time variance (Q2003576) (← links)
• Hierarchical minimization of completion time variance and makespan in jobshops (Q2496030) (← links)
• Using a hybrid evolutionary algorithm to minimize variance in response time for multimedia object requests (Q2583511) (← 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)
• Tabu search for a class of single-machine scheduling problems (Q5945325) (← links)