A tight lower bound for the completion time variance problem

DOI10.1016/0377-2217(95)00165-4zbMath0912.90179OpenAlexW1987093695MaRDI QIDQ1268251

K. Appert

Publication date: 25 May 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00165-4

zbMATH Keywords

mean completion timecompletion time variancetight lower bound

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION ⋮ Minimizing completion time variance with compressible processing times ⋮ Using a hybrid evolutionary algorithm to minimize variance in response time for multimedia object requests

Cites Work

• Mimimization of agreeably weighted variance in single machine systems
• Proof of a conjecture of Schrage about the completion time variance problem
• Completion time variance minimization on a single machine is difficult
• New results on the completion time variance minimization
• 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
• Note—A Note on the Minimization of Mean Squared Deviation of Completion Times About a Common Due Date
• Variance Minimization in Single Machine Sequencing Problems

This page was built for publication: A tight lower bound for the completion time variance problem