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

DOI10.1023/A:1018926305578zbMath0890.90090OpenAlexW116131455MaRDI QIDQ1374437

S. A. Zhou, Xiaoqiang Cai

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

zbMATH Keywords

single machinesequencingvariance minimizationpseudopolynomial timerandom processing time

Mathematics Subject Classification ID

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

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