Minimising variance of job completion times in a single machine

DOI10.1504/IJOR.2012.044030zbMath1362.90214OpenAlexW2098672997MaRDI QIDQ2627247

Yanyan Li

Publication date: 31 May 2017

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

Full work available at URL: https://doi.org/10.1504/ijor.2012.044030

zbMATH Keywords

branch and boundsingle machine schedulingjob completion timescompletion time variance

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Completion time variance minimisation on two identical parallel processors

This page was built for publication: Minimising variance of job completion times in a single machine