A solvable case of the variance minimization problem

DOI10.1016/0893-9659(93)90086-3zbMATH Open0813.90059OpenAlexW1994062246MaRDI QIDQ1324501FDOQ1324501

Authors: V. Pereyra 

Publication date: 24 May 1994

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0893-9659(93)90086-3

Recommendations

• Completion time variance minimization on a single machine is difficult
• A branch and bound algorithm to minimize completion time variance on a single processor.
• Minimizing completion time variance with compressible processing times
• New results on the completion time variance minimization

zbMATH Keywords

equal processing timescompletion time variancearbitrary weights

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Variance Minimization in Single Machine Sequencing Problems
• Minimizing the Time-in-System Variance for a Finite Jobset
• Minimising Waiting Time Variance in the Single Machine Problem
• Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
• Deterministic and Random Single Machine Sequencing with Variance Minimization

Cited In (6)

• A minimax job completion-time problem revisited
• Permutation polyhedra and minimisation of the variance of completion times on a single machine
• Mimimization of agreeably weighted variance in single machine systems
• Title not available (Why is that?)
• Minimizing completion time variance with compressible processing times
• Completion time variance minimization on a single machine is difficult

This page was built for publication: A solvable case of the variance minimization problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1324501)