Optimal sequencing of a set of positive numbers with the variance of the sequence's partial sums maximized

DOI10.1007/S11590-012-0449-9zbMath1300.90051arXiv1202.2410OpenAlexW3105170761MaRDI QIDQ360482

Dingxing Chen, En Yuan, Li Wei, Wangdong Qi, Peng Liu

Publication date: 27 August 2013

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.2410

zbMATH Keywords

variancesequencingpartial sumsoptimal sequence

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (2)

Another well-solvable case of the QAP: maximizing the job completion time variance ⋮ Linear programming insights into solvable cases of the quadratic assignment problem

Cites Work

• Job scheduling methods for reducing waiting time variance
• Proof of a conjecture of Schrage about the completion time variance problem
• Completion time variance minimization on a single machine is difficult
• A branch and bound algorithm to minimize completion time variance on a single processor.
• Batch scheduling and common due-date assignment on a single machine
• Minimizing the Time-in-System Variance for a Finite Jobset
• Minimising Waiting Time Variance in the Single Machine Problem
• Variance Minimization in Single Machine Sequencing Problems

This page was built for publication: Optimal sequencing of a set of positive numbers with the variance of the sequence's partial sums maximized