scientific article; zbMATH DE number 764420

MaRDI QIDQ4836307zbMATH OpenFDO

Authors

Publication date 1995

zbMATH Keywords

completion time varianceindependent jobslinear cost for compressionprocessing timespseudo-polynomial algorithmsingle machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Minimizing completion time variance with compressible processing times
• Pseudopolynomial algorithms for CTV minimization in single machine scheduling
• A survey of results for sequencing problems with controllable processing times
• A solvable case of the variance minimization problem
• scientific article; zbMATH DE number 1271637

Cited in

(2)

• Pseudopolynomial algorithms for CTV minimization in single machine scheduling
• Minimizing completion time variance with compressible processing times

This page was built for publication:

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