A branch and bound algorithm to minimize completion time variance on a single processor.
type: Item
instance of: scholarly article
title: A branch and bound algorithm to minimize completion time variance on a single processor.
zbMATH Open document ID: 1049.90028
DOI: 10.1016/S0305-0548(02)00062-X
author: D. Massart
published in: Computers \& Operations Research
publication date: 2003-11-17T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 2005373
zbMATH Keywords: Single machine scheduling
zbMATH Keywords: Completion time variance
zbMATH Keywords: Lower bound
zbMATH Keywords: Branch and bound
MaRDI profile type: Publication
cites work: Variance Minimization in Single Machine Sequencing Problems
cites work: Minimizing the Time-in-System Variance for a Finite Jobset
cites work: Proof of a conjecture of Schrage about the completion time variance problem
cites work: Minimising Waiting Time Variance in the Single Machine Problem
cites work: Minimizing Variation of Flow Time in Single Machine Systems
cites work: Deterministic and Random Single Machine Sequencing with Variance Minimization
cites work: Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
cites work: Minimizing the Flow-time Variance in Single-machine Systems
cites work: A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions
cites work: Minimizing flow time variance in a single machine system using genetic algorithms
cites work: Minimizing Single-Machine Completion Time Variance
cites work: Bounds for the position of the smallest job in completion time variance minimization
cites work: On the Minimization of Completion Time Variance with a Bicriteria Extension
cites work: A note on lower bound for completion time variance in single machine scheduling.
cites work: Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs
Recommended article: A branch and bound procedure to minimize mean absolute lateness on a single processor
Recommended article: A branch and bound algorithm to minimize total weighted tardiness on a single processor
Recommended article: A branch and price algorithm for single-machine completion time variance
Recommended article: Single- and multiple-processor models for minimizing completion time variance
Recommended article: Q3142063
Recommended article: A branch and bound algorithm for minimizing weighted completion times with deadlines
Recommended article: A tight lower bound for the completion time variance problem
Recommended article: A branch and bound algorithm for the response time variability problem
Recommended article: An almost exact solution to the min completion time variance in a single machine
Recommended article: A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates
description: scientific article; zbMATH DE number 2005373