Volume 16, Number 1, 1989
, Judy Brown
: A model for the allocation of graduate assistant hours: an anecdote on the application of operations research.
Volume 16, Number 2, 1989
: Some remarks on uniformly bounded markov chains: multimodality analysis.
Bart van Arem
: Discrete time analysis of a slotted transmission system.
: On the convergence of one-dimensional simplex search.
: Ranking multiple criteria alternatives with half-space, convex, and non-convex dominating cones: quasi-concave and quasi-convex multiple attribute utility functions.
P. Simin Pulat
: A decomposition algorithm to determine the maximum flow in a generalized network.
: An analysis of an available set of linear programming test problems.
D. J. White
: The "largest element first" heuristic for the maximization assignment problem.
Volume 16, Number 3, 1989
Andre B. Bondi
: An analysis of finite capacity queues with priority scheduling and common or reserved waiting areas.
, Yu-Ping Hou
: Allocating primary and back-up copies of databases in distributed computer systems: A model and solution procedures.
Volume 16, Number 4, 1989
Richard A. Murphy
: An improved direct descent algorithm for binary knapsack problems.
R. P. Hope
, J. A. Sharp
: The use of two planning decision support systems in combination for the redesign of an MBA information technology programme.
Jay E. Aronson
, B. David Chen
: A primary/secondary memory implementation of a forward network simplex algorithm for multiperiod network flow problems.
Volume 16, Number 5, 1989
: A labeling algorithm to solve the assignment problem.
Y. L. Chen
, Y. H. Chin
: Scheduling unit-time jobs on processors with different capabilities.
Kyung Y. Jo
: A lagrangian algorithm for computing the optimal service rates in Jackson queuing networks.
Thuruthickara C. John
: Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty.
Volume 16, Number 6, 1989
: Quantitative evaluation of micro versus larger database products.
Wen Lea Pearn
: Approximate solutions for the capacitated arc routing problem.