Minimizing class-based completion time variance on a single machine

MaRDI QIDQ3518841zbMATH OpenFDO

Authors Yuerong Chen, Yang Sun, Rapinder Sawhney, Xueping Li

Publication date 12 August 2008

zbMATH Keywords

class-based completion time variance (CB-CTV)completion time variance (CTV)job schedulingoptimization

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Minimising variance of job completion times in a single machine
• New results on the completion time variance minimization
• Pseudopolynomial algorithms for CTV minimization in single machine scheduling
• Completion time variance minimisation on two identical parallel processors
• A branch and bound algorithm to minimize completion time variance on a single processor.

Cited in

(2)

• Minimising variance of job completion times in a single machine
• Job scheduling methods for reducing waiting time variance

This page was built for publication: Minimizing class-based completion time variance on a single machine

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