A suboptimality bound for permutation policies in single machine stochastic scheduling

K. D. Glazebrook

Naval Research Logistics (NRL), 1995, vol. 42, issue 6, 993-1005

Abstract: A general class of single machine stochastic scheduling problems incorporating precedence constraints is modelled as a family of competing Markov decision processes. A bound on the optimal return yields a suboptimality bound for permutation policies. This in turn leads to a generalised “used better than new” principle as a (highly intuitive) sufficient condition for the optimality of a permutation policy in the class of all (preemptive) policies. © 1995 John Wiley & Sons, Inc.

Date: 1995
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199509)42:63.0.CO;2-P

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:wly:navres:v:42:y:1995:i:6:p:993-1005

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().