Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Glazebrook, K. D.
1981.
On nonpreemptive strategies in stochastic scheduling.
Naval Research Logistics Quarterly,
Vol. 28,
Issue. 2,
p.
289.
Glazebrook, K.D.
1982.
On the evaluation of fixed permutations as strategies in stochastic scheduling.
Stochastic Processes and their Applications,
Vol. 13,
Issue. 2,
p.
171.
Glazebrook, K. D.
1982.
Deterministic and Stochastic Scheduling.
p.
375.
Glazebrook, K. D.
1984.
Scheduling stochastic jobs on a single machine subject to breakdowns.
Naval Research Logistics Quarterly,
Vol. 31,
Issue. 2,
p.
251.
Varaiya, P.
Walrand, J.
and
Buyukkoc, C.
1985.
Extensions of the multiarmed bandit problem: The discounted case.
IEEE Transactions on Automatic Control,
Vol. 30,
Issue. 5,
p.
426.
Gupta, Sushil K
and
Kyparisis, Jerzy
1987.
Single machine scheduling research.
Omega,
Vol. 15,
Issue. 3,
p.
207.
Fay, N. A.
and
Glazebrook, K. D.
1989.
A General Model for the Scheduling of Alternative Stochastic Jobs that may Fail.
Probability in the Engineering and Informational Sciences,
Vol. 3,
Issue. 2,
p.
199.
Birge, J.
Frenk, J. B. G.
Mittenthal, J.
and
Kan, A. H. G. Rinnooy
1990.
Single-machine scheduling subject to stochastic breakdowns.
Naval Research Logistics,
Vol. 37,
Issue. 5,
p.
661.
Benhenni, Robert A.
1991.
Monotone stopping-allocation problems.
Advances in Applied Probability,
Vol. 23,
Issue. 1,
p.
24.
frenk, J. B. G.
1991.
A General Framework for Stochastic One-machine Scheduling Problems with Zero Release Times and No Partial Ordering.
Probability in the Engineering and Informational Sciences,
Vol. 5,
Issue. 3,
p.
297.
Van Oyen, M.P.
and
Teneketzis, D.
1992.
Optimal stochastic scheduling of connected queues with switching costs.
p.
3328.
Van Oyen, Mark P.
Pandelis, Dimitrios G.
and
Teneketzis, Demosthenis
1992.
Optimality of index policies for stochastic scheduling with switching penalties.
Journal of Applied Probability,
Vol. 29,
Issue. 04,
p.
957.
Asawa, M.
and
Teneketzis, D.
1994.
Multi-armed bandits with switching costs.
Vol. 1,
Issue. ,
p.
168.
Van Oyen, Mark P.
and
Teneketzis, Demosthenis
1994.
Optimal stochastic scheduling of forest networks with switching penalties.
Advances in Applied Probability,
Vol. 26,
Issue. 2,
p.
474.
Tapiero, Charles S.
1994.
Applicable stochastic control: From theory to practice.
European Journal of Operational Research,
Vol. 73,
Issue. 2,
p.
209.
Duff, Michael O.
1995.
Machine Learning Proceedings 1995.
p.
209.
Glazebrook, K. D.
1995.
A suboptimality bound for permutation policies in single machine stochastic scheduling.
Naval Research Logistics,
Vol. 42,
Issue. 6,
p.
993.
Asawa, M.
and
Teneketzis, D.
1996.
Multi-armed bandits with switching penalties.
IEEE Transactions on Automatic Control,
Vol. 41,
Issue. 3,
p.
328.
Iravani, Seyed M. R.
Buzacott, John A.
and
Posner, Morton J. M.
2003.
Operations and Shipment Scheduling of a Batch on a Flexible Machine.
Operations Research,
Vol. 51,
Issue. 4,
p.
585.
Glazebrook, K. D.
Ruiz-Hernandez, D.
and
Kirkbride, C.
2006.
Some indexable families of restless bandit problems.
Advances in Applied Probability,
Vol. 38,
Issue. 03,
p.
643.