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

DOI10.1287/opre.29.1.161zbMath0453.90049OpenAlexW1986416206MaRDI QIDQ3901287

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

single machine schedulingjobshop schedulinglinear costsdetermination of optimal strategiesprecedence relationsdiscounted costsresearch planningorder- constrained stochastic scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (10)

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

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