Completion time variance minimisation on two identical parallel processors

DOI10.1016/j.cor.2017.05.001zbMath1391.90320OpenAlexW2611736339MaRDI QIDQ1652377

B. Srirangacharyulu

Publication date: 11 July 2018

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

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

zbMATH Keywords

schedulingbranch and boundcompletion time variance

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

A branch and price algorithm for single-machine completion time variance

Cites Work

• Completion time variance minimization in single machine and multi-machine systems
• Proof of a conjecture of Schrage about the completion time variance problem
• A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions
• Bounds for the position of the smallest job in completion time variance minimization
• Minimizing flow time variance in a single machine system using genetic algorithms
• Completion time variance minimization on a single machine is difficult
• Multi-machine scheduling with variance minimization
• A branch and bound algorithm to minimize completion time variance on a single processor.
• Minimising variance of job completion times in a single machine
• Minimizing the average deviation of job completion times about a common due date
• Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
• Minimizing Variation of Flow Time in Single Machine Systems
• On the Minimization of Completion Time Variance with a Bicriteria Extension
• Minimizing the Time-in-System Variance for a Finite Jobset
• Minimising Waiting Time Variance in the Single Machine Problem
• Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs
• Deterministic and Random Single Machine Sequencing with Variance Minimization
• Minimizing the Flow-time Variance in Single-machine Systems
• Variance Minimization in Single Machine Sequencing Problems
• Tabu search for a class of single-machine scheduling problems

This page was built for publication: Completion time variance minimisation on two identical parallel processors