You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Strategy Evaluation for Stochastic Scheduling Problems with Order Constraints
K. D. Glazebrook
Advances in Applied Probability
Vol. 23, No. 1 (Mar., 1991), pp. 86-104
Published by: Applied Probability Trust
Stable URL: http://www.jstor.org/stable/1427513
Page Count: 19
You can always find the topics here!Topics: Scheduling, Optimal strategies, Job performance evaluation, Stopping distances, Mathematical induction, Sufficient conditions for optimality, Admissible sets, Heuristics, Operations research, Mathematical problems
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
A single machine is available to process a collection J of jobs. The machine is free to switch between jobs at any time, but processing must respect a set Γ of precedence constraints. Jobs evolve stochastically and earn rewards as they are processed, not otherwise. The theoretical framework of forwards induction/Gittins indexation is used to develop approaches to strategy evaluation for quite general (J,Γ). The performance of both forwards induction strategies and a class of quasi-myopic heuristics is assessed.
Advances in Applied Probability © 1991 Applied Probability Trust