Stochastic scheduling and forwards induction

DOI10.1016/0166-218X(94)00101-IzbMath0820.90051OpenAlexW2015055822MaRDI QIDQ1346693

Kevin D. Glazebrook

Publication date: 10 April 1995

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(94)00101-i

zbMATH Keywords

single machineprecedence constraintsdiscounted Markov decision processstochastic tasks

Mathematics Subject Classification ID

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

Related Items (1)

A forwards induction approach to candidate drug selection

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Arm-acquiring bandits
• On the evaluation of fixed permutations as strategies in stochastic scheduling
• Algorithms for evaluating the dynamic allocation index
• Multiple feedback at a single-server station
• Optimal strategies for a class of constrained sequential problems
• On scheduling influential stochastic tasks on a single machine
• Indices for families of competing Markov decision processes with influence
• The performance of forwards induction policies
• Suppression of axial combustion instability in solid rocket motors
• Procedures for the evaluation of strategies for resource allocation in a stochastic environment
• A General Model for the Scheduling of Alternative Stochastic Jobs that may Fail
• Extensions of the multiarmed bandit problem: The discounted case
• Semi-Markov models for single-machine stochastic scheduling problems
• The Multi-Armed Bandit Problem: Decomposition and Computation
• Sensitivity Analysis for Stochastic Scheduling Problems
• Oil exploration: sequential decisions in the face of uncertainty
• Sequencing with Series-Parallel Precedence Constraints
• On Single-Machine Scheduling with Precedence Relations and Linear or Discounted Costs
• Scheduling jobs by stochastic processing requirements on parallel machines to minimize makespan or flowtime
• On a sufficient condition for superprocesses due to whittle
• On the evaluation of suboptimal strategies for families of alternative bandit processes
• The value of the stochastic solution in stochastic linear programs with fixed recourse
• On an index policy for restless bandits
• Bounds for discounted stochastic scheduling problems
• On a “No Arrivals” Heuristic for Single Machine Stochastic Scheduling
• Single-machine stochastic scheduling with dependent processing times
• Extension of the bivariate characterization for stochastic orders
• Cost rate heuristics for semi-Markov decision processes
• Stochastic scheduling with order constraints
• Complexity of Scheduling under Precedence Constraints
• Algoristics for Single-Machine Sequencing with Precedence Constraints
• Single-Visit Policies for Allocating a Single Resource in a Stochastic Environment
• On the Value of Adaptive Solutions to Stochastic Scheduling Problems
• Strategy evaluation for stochastic scheduling problems with order constraints

This page was built for publication: Stochastic scheduling and forwards induction