-
D.G. Pandelis (2007), “Optimal use of excess capacity in two interconnected queues,” Mathematical Methods of Operations Research 65, 179-192.
-
D.G. Pandelis and D. Teneketzis (1999), “On the optimality of the Gittins index rule for multi-armed bandits with multiple plays,” Mathematical Methods of Operations Research 50-3, 449-461.
-
D.G. Pandelis and D. Teneketzis (1996), “A simple load balancing problem with decentralized information,” Mathematical Methods of Operations Research 44-1, 97-113.
-
D.G. Pandelis and D. Teneketzis (1996), “Optimal sequencing in multiserver systems,” Probability in the Engineering and Informational Sciences 10, 377-396.
-
D.G. Pandelis and D. Teneketzis (1994), “Optimal multiserver stochastic scheduling of two interconnected priority queues,” Advances in Applied Probability 26, 258-279.
-
D.G. Pandelis and D. Teneketzis (1994), “Optimal stochastic dynamic scheduling in multiclass queues with tardiness and/or earliness penalties,” Probability in the Engineering and Informational Sciences 8, 491-509.
-
D.G. Pandelis and D. Teneketzis (1993), “Stochastic scheduling in priority queues with strict deadlines,” Probability in the Engineering and Informational Sciences 7, 273-289.
-
M.P. Van Oyen, D.G. Pandelis, and D. Teneketzis (1992), “Optimality of index policies for stochastic scheduling problems with switching penalties,” Journal of Applied Probability 29, 957-966.
-
P.D. Kaklis and D.G. Pandelis (1990), “Convexity-preserving polynomial splines of non-uniform degree,” IMA Journal of Numerical Analysis 10, 223-234.
