A note on lower bound for completion time variance in single machine scheduling.

DOI10.1007/BF03398531zbMath1141.90433OpenAlexW2733855627MaRDI QIDQ2468562

Yanyan Li

Publication date: 25 January 2008

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03398531

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

A branch and bound algorithm to minimize completion time variance on a single processor.

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling about a common due date with earliness and tardiness penalties
• Completion time variance minimization on a single machine is difficult
• On the Minimization of Completion Time Variance with a Bicriteria Extension
• Variance Minimization in Single Machine Sequencing Problems

This page was built for publication: A note on lower bound for completion time variance in single machine scheduling.