| 83 | -- | 89 | Shane G. Henderson, Peter W. Glynn. Nonexistence of a class of variate generation schemes |
| 90 | -- | 94 | Alfred Müller. On the interplay between variability and negative dependence for bivariate distributions |
| 95 | -- | 100 | Krishnan Kumaran, Michel Mandjes, Alexander L. Stolyar. Convexity properties of loss and overflow functions |
| 101 | -- | 107 | Mohan L. Chaudhry, Nam K. Kim. A complete and simple solution for a discrete-time multi-server queue with bulk arrivals and deterministic service times |
| 108 | -- | 118 | Alexander N. Dudin, Valentina I. Klimenok. Optimal admission control in a queueing system with heterogeneous traffic |
| 119 | -- | 123 | Jiahua Chen, Dennis K. J. Lin, Douglas J. Thomas. On the single item fill rate for a finite horizon |
| 124 | -- | 128 | Jesús M. Jorge. Maximal descriptor set characterizations of efficient faces in multiple objective linear programming |
| 129 | -- | 136 | Peter Brucker, Silvia Heitmann, Johann Hurink. How useful are preemptive schedules? |
| 137 | -- | 141 | Cor A. J. Hurkens, Tjark Vredeveld. Local search for multiprocessor scheduling: how many moves does it take to a local optimum? |
| 142 | -- | 148 | Federico Della Croce, Vincent T Kindt. Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem |
| 149 | -- | 160 | Stefano Pallottino, Maria Grazia Scutellà. A new algorithm for reoptimizing shortest paths when the arc costs change |
| 161 | -- | 166 | Liping Zhang. On the convergence of a modified algorithm for the spherical facility location problem |