| 117 | -- | 124 | R. Bruce Mattingly. A Revised Stochastic Complementation Algorithm for Nearly Completely Decomposable Markov Chains |
| 125 | -- | 139 | Peter J. Downey. Bounds and Approximations for Overheads in the Time to Join Parallel Forks |
| 140 | -- | 148 | David L. Jagerman, Benjamin Melamed. Spectral Analysis of Basic TES Processes |
| 149 | -- | 159 | June S. Park, Robert Bartoszynski, Walter A. Rosenkrantz. Stability of ::::p::::-Persistent CSMA/CD |
| 160 | -- | 165 | Carsten Jordan, Andreas Drexl. A Comparison of Constraint and Mixed-Integer Programming Solvers for Batch Sequencing with Sequence-Dependent Setups |
| 166 | -- | 190 | Robert Fourer, David M. Gay. Expressing Special Structures in an Algebraic Modeling Language for Mathematical Programming |
| 191 | -- | 200 | Mauro Dell Amico, Silvano Martello. Optimal Scheduling of Tasks on Identical Parallel Processors |
| 201 | -- | 204 | Sunan Han, Dawei Hong, Joseph Y.-T. Leung. On the Asymptotic Optimality of Multiprocessor Scheduling Heuristics for the Makespan Minimization Problem |
| 205 | -- | 217 | Harvey J. Greenberg. Analyzing the Pooling Problem |
| 218 | -- | 231 | Abraham Mehrez, Geoffrey Steinberg. A Matching Identification Problem: A Knowledge Acquisition Approach |
| 232 | -- | 242 | A. M. A. Hariri, C. N. Potts, Luk N. Van Wassenhove. Single Machine Scheduling to Minimize Total Weighted Late Work |