Methods for the Evaluation of Permutations as Strategies in Stochastic Scheduling Problems
A collection of stochastic jobs is to be processed by a single machine in a manner which is consistent with a precedence relation on the job set. Costs are incurred as jobs are processed and rewards are earned when they complete. The problem of finding optimal processing strategies is in general very complex. However, algorithms exist which in many cases yield the strategies which are optimal among those which are simply permutations of the job set. In light of this, the question of how well permutations perform as strategies is an important one. We present methods which aim to answer this question. They are based on earlier results by Glazebrook.
Volume (Year): 29 (1983)
Issue (Month): 10 (October)
|Contact details of provider:|| Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA|
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:29:y:1983:i:10:p:1142-1155. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)
If references are entirely missing, you can add them using this form.