On Single-Machine Scheduling with Precedence Relations and Linear or Discounted Costs

DOI10.1287/OPRE.29.1.161MaRDI QIDQ3901287zbMATH OpenOpenAlexFDO

Authors Kevin D. Glazebrook, J. C. Gittins

Publication date 1981

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.29.1.161

zbMATH Keywords

determination of optimal strategiesdiscounted costsjobshop schedulinglinear costsorder- constrained stochastic schedulingprecedence relationsresearch planningsingle machine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited in

(10)

• On the evaluation of fixed permutations as strategies in stochastic scheduling
• On the evaluation of strategies for branching bandit processes
• On scheduling influential stochastic tasks on a single machine
• Job selection and sequencing on a single machine in a random environment
• Stochastic scheduling and forwards induction
• Bounds on optimal values in stochastic scheduling
• Single machine scheduling with precedence constraints and positionally dependent processing times
• Semi-Markov models for single-machine stochastic scheduling problems
• On the evaluation of strategies for stochastic scheduling problems with order constraints
• New results for generalized bandit problems

This page was built for publication: On Single-Machine Scheduling with Precedence Relations and Linear or Discounted Costs

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