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-PzbMATH Open0845.90070OpenAlexW1981190606MaRDI QIDQ4865766FDOQ4865766

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

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

zbMATH Keywords

precedence constraintssingle machine stochastic schedulingcompeting Markov decision processes

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Gittins-index heuristics for research planning

Cited In (2)

• Bounds for discounted stochastic scheduling problems
• A General Framework for Stochastic One-machine Scheduling Problems with Zero Release Times and No Partial Ordering

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)