A suboptimality bound for permutation policies in single machine stochastic scheduling

DOI10.1002/1520-6750(199509)42:6%3C993::AID-NAV3220420609%3E3.0.CO;2-PMaRDI QIDQ4865766zbMATH OpenOpenAlexFDO

Authors Kevin D. Glazebrook

Publication date 10 April 1996

Full work available at URL https://doi.org/10.1002/1520-6750(199509)42:6%3C993::aid-nav3220420609%3E3.0.co;2-p

zbMATH Keywords

competing Markov decision processesprecedence constraintssingle machine stochastic scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Stochastic systems in control theory (general) (93E03)

Recommendations

• On stochastic machine scheduling with general distributional assumptions
• On permutation policies for the scheduling of deteriorating stochastic jobs on a single machine
• Stochastic scheduling and forwards induction
• Bounds on optimal values in stochastic scheduling
• scientific article; zbMATH DE number 3906216

Cites work

• Gittins-index heuristics for research planning
• scientific article; zbMATH DE number 3338194 (Why is no real title available?)

Cited in

(5)

• Bounds on optimal values in stochastic scheduling
• A General Framework for Stochastic One-machine Scheduling Problems with Zero Release Times and No Partial Ordering
• scientific article; zbMATH DE number 29800 (Why is no real title available?)
• Bounds for discounted stochastic scheduling problems
• On permutation policies for the scheduling of deteriorating stochastic jobs on a single machine

This page was built for publication: A suboptimality bound for permutation policies in single machine stochastic scheduling

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