Job scheduling methods for reducing waiting time variance

DOI10.1016/j.cor.2005.11.015zbMath1185.90104OpenAlexW2128472960MaRDI QIDQ878584

Toni Farley, Nong Ye, Xue-Ping Li, Xiao Yun Xu

Publication date: 26 April 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.11.015

zbMATH Keywords

job schedulingquality of service (QoS)computer networkswaiting time variance

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

Related Items

Optimal sequencing of a set of positive numbers with the variance of the sequence's partial sums maximized, Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling, A lower bound for weighted completion time variance, Minimizing the total waiting time of intermediate products in a manufacturing process

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof of a conjecture of Schrage about the completion time variance problem
• \(V\)-shape property for job sequences that minimize the expected completion time variance
• Bounds for the position of the smallest job in completion time variance minimization
• Completion time variance minimization on a single machine is difficult
• Pseudopolynomial algorithms for CTV minimization in single machine scheduling
• \(V\)- and \(\Lambda\)-shaped properties for optimal single machine schedules for a class of non-separable penalty functions
• A branch and bound algorithm to minimize completion time variance on a single processor.
• Fast fully polynomial approximation schemes for minimizing completion time variance
• New results on the completion time variance minimization
• A class of on-line scheduling algorithms to minimize total completion time
• Web server QoS models: applying scheduling rules from production planning
• Minimizing Variation of Flow Time in Single Machine Systems
• On the Minimization of Completion Time Variance with a Bicriteria Extension
• A comparison of list schedules for parallel processing systems
• Minimizing the Time-in-System Variance for a Finite Jobset
• Minimising Waiting Time Variance in the Single Machine Problem
• Deterministic and Random Single Machine Sequencing with Variance Minimization
• Variance Minimization in Single Machine Sequencing Problems
• Tabu search for a class of single-machine scheduling problems
• Algorithms for minclique scheduling problems