Minimization of expected variance of completion times on single machine for stochastic jobs

DOI10.1002/(SICI)1520-6750(199702)44:1%3C97::AID-NAV6%3E3.0.CO;2-HzbMATH Open0882.90074OpenAlexW2074730781MaRDI QIDQ4346869FDOQ4346869

Authors: V. Rajendra Prasad, D. K. Manna 

Publication date: 15 March 1998

Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199702)44:1%3C97::aid-nav6%3E3.0.co;2-h

Recommendations

• A single-machine scheduling problem with random processing times
• \(V\)-shape property for job sequences that minimize the expected completion time variance
• Deterministic and Random Single Machine Sequencing with Variance Minimization
• Sequencing jobs with random processing times to minimize weighted completion time variance
• Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem

Mathematics Subject Classification ID

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

Cited In (6)

• Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem
• A single-machine scheduling problem with random processing times
• On the completion time of a job processed on an unreliable machine
• Minimising variance of job completion times in a single machine
• Pseudopolynomial algorithms for CTV minimization in single machine scheduling
• Deterministic and Random Single Machine Sequencing with Variance Minimization

This page was built for publication: Minimization of expected variance of completion times on single machine for stochastic jobs

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