Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1520-6750(199906)46:4<373::AID-NAV3>3.0.CO;2-W" /><373::AID-NAV3>3.0.CO;2-W 10.1002/(SICI)1520-6750(199906)46:4<373::AID-NAV3>3.0.CO;2-WzbMath0957.90068OpenAlexW2070101535MaRDI QIDQ4261219

No author found.

Publication date: 1 September 1999

Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199906)46:4<373::aid-nav3>3.0.co;2-w

zbMATH Keywords

probabilistic analysisapproximate optimizationscheduling/sequencingcompletion time variance

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Stochastic scheduling theory in operations research (90B36)

Related Items (1)

A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION

Cites Work

• Unnamed Item

This page was built for publication: Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem