Methods for the Evaluation of Permutations as Strategies in Stochastic Scheduling Problems

K. D. Glazebrook
Additional contact information
K. D. Glazebrook: University of Newcastle Upon Tyne, Great Britain

Management Science, 1983, vol. 29, issue 10, 1142-1155

Abstract: 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.

Keywords: production/scheduling: job shop; stochastic; dynamic programming; probability: Markov processes (search for similar items in EconPapers)
Date: 1983
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.29.10.1142 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:29:y:1983:i:10:p:1142-1155

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().