A branch and bound algorithm to minimize completion time variance on a single processor.

DOI10.1016/S0305-0548(02)00062-XzbMath1049.90028MaRDI QIDQ1413810

D. Massart

Publication date: 17 November 2003

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

zbMATH Keywords

Branch and boundLower boundSingle machine schedulingCompletion time variance

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (12)

Completion time variance minimisation on two identical parallel processors ⋮ Optimal sequencing of a set of positive numbers with the variance of the sequence's partial sums maximized ⋮ Job scheduling methods for reducing waiting time variance ⋮ A lower bound for weighted completion time variance ⋮ Time-flexible min completion time variance in a single machine by quadratic programming ⋮ An almost exact solution to the min completion time variance in a single machine ⋮ A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION ⋮ A branch and price algorithm for single-machine completion time variance ⋮ An efficient local search for minimizing completion time variance in permutation flow shops ⋮ Hierarchical minimization of completion time variance and makespan in jobshops ⋮ Completion time variance minimization in single machine and multi-machine systems ⋮ An exact algorithm to minimize mean squared deviation of job completion times about a common due date

Cites Work

• 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
• A note on lower bound for completion time variance in single machine scheduling.
• Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and 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
• Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs
• Minimizing Single-Machine Completion Time Variance
• 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

This page was built for publication: A branch and bound algorithm to minimize completion time variance on a single processor.