On the evaluation of fixed permutations as strategies in stochastic scheduling

K. D. Glazebrook

Stochastic Processes and their Applications, 1982, vol. 13, issue 2, 171-187

Abstract: A general model is proposed for the stochastic version of the single-machine allocation problem. Sufficient conditions are given to ensure that there is an optimal strategy given by a fixed permutation of the job set. Additional results are given for an important special case of the general model involving simple jobs. The paper concludes with material concerning the evaluation of fixed permutations as strategies under conditions more general than the sufficient conditions mentioned above.

Keywords: Dynamic; programming; non-preemptive; strategies; switching; costs; Markov; decision; processes; stochastic; scheduling (search for similar items in EconPapers)
Date: 1982
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0304-4149(82)90033-3
Full text for ScienceDirect subscribers only

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:eee:spapps:v:13:y:1982:i:2:p:171-187

Ordering information: This journal article can be ordered from
http://http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Stochastic Processes and their Applications is currently edited by T. Mikosch

More articles in Stochastic Processes and their Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().