Sequencing jobs with random processing times to minimize weighted completion time variance

DOI10.1023/A:1018926305578zbMATH Open0890.90090OpenAlexW116131455MaRDI QIDQ1374437FDOQ1374437

Authors: Xiaoqiang Cai, Sean Zhou 

Publication date: 4 December 1997

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018926305578

Recommendations

• Minimization of expected variance of completion times on single machine for stochastic jobs
• Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem
• Deterministic and Random Single Machine Sequencing with Variance Minimization
• \(V\)-shape property for job sequences that minimize the expected completion time variance
• Mimimization of agreeably weighted variance in single machine systems

zbMATH Keywords

single machinesequencingvariance minimizationpseudopolynomial timerandom processing time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Stochastic programming (90C15)

Cited In (1)

• Approximate sequencing for variable length tasks.

This page was built for publication: Sequencing jobs with random processing times to minimize weighted completion time variance

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