Operations Research

1952 - 2025

From INFORMS
Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().

Access Statistics for this journal.
Is something missing from the series or not right? See the RePEc data check for the archive and series.

Volume 20, issue 6, 1972

Operating Characteristics of a Simple Shuttle under Local Dispatching Rules pp. 1077-1088

Edward Ignall and Peter Kolesar

Air-Terminal Queues under Time-Dependent Conditions pp. 1089-1114

Bernard O. Koopman

L = λ W: A Discounted Analogue and a New Proof pp. 1115-1126

Shaler Stidham

A Generalization of L = λ W to Moments of Queue Length and Waiting Times pp. 1127-1136

Shelby L. Brumelle

System States for a Series of Finite Queues pp. 1137-1141

Brian J. Haydon

Mathematical Models for Controlling Growing Biological Populations: A Survey pp. 1142-1151

David L. Jaquette

On the Set-Covering Problem pp. 1152-1161

Egon Balas and Manfred W. Padberg

Parametric Network Flows pp. 1162-1170

Edward Minieka

Monte Carlo Simulation of Operating-Room and Recovery-Room Usage pp. 1171-1180

Homer H. Schmitz and N. K. Kwak

An Optimal Policy for Operating a Multipurpose Reservoir pp. 1181-1189

C. Bradley Russell

Technical Note—Equivalent Payload Nomogram pp. 1190-1192

S. Matlin

Letter to the Editor—Operations Research as a Basis for Getting Engineering and Liberal-Arts Students to Work Together pp. 1193-1194

Robert J. Brungraber

Letter to the Editor—Comments on “A Note on the Solution to Lanchester-type Equations with Variable Coefficients” pp. 1194-1195

James G. Taylor

Volume 20, issue 5, 1972

Operations Research in Planning Political Campaign Strategies pp. 925-941

Joel D. Barkan and James E. Bruno

Financing Mental-Health Services in the State of New York pp. 942-954

Lawrence D. Bodin, T. Owen Carroll, Allen Lee and Sally Stout

A Statistical Technique for the Control of Traffic Intensity in the Queuing Systems M / G /1 and GI / M /1 pp. 955-966

U. Narayan Bhat and S. Subba Rao

Optimum Locations of Centers in Networks pp. 967-973

S. L. Hakimi and S. N. Maheshwari

Ratios in Planning-Budgeting and Bounds on Resource Requirements pp. 974-983

Jonathan Halpern

Vicinal Sequencing Problems pp. 984-992

Gerhard Jaeschke

Problem Decomposition and Data Reorganization by a Clustering Technique pp. 993-1009

William T. McCormick, Paul J. Schweitzer and Thomas W. White

A Partitioning Problem with Applications in Regional Design pp. 1010-1019

H. W. Corley and S. D. Roberts

The ( S − 1, S ) Inventory Model with Arbitrary Back-Ordered Demand and Constant Delivery Times pp. 1020-1032

Marshall Rose

A Model for Analyzing Artillery Registration Procedures pp. 1033-1043

Donald R. Barr and Larry D. Piper

Technical Note—Bounds for the Travelling-Salesman Problem pp. 1044-1056

Nicos Christofides

Letter to the Editor—The Synergy of Operations Research and Computers pp. 1057-1064

Arne Mjosund

Acknowledgment pp. 1065-1065

Robert M. Oliver and David S. P. Hopkins

Volume 20, issue 4, 1972

Optimal Linear Ordering of Information Items pp. 741-751

Philip M. Morse

Optional Specification of Air-Pollution-Emission Regulations Including Reliability Requirements pp. 752-763

Alfred Blumstein, R. Gordon Cassidy, Wilpen L. Gorr and Anthony S. Walters

Optimal Search with Uncertain Sweep Width pp. 764-784

Henry R. Richardson and Barry Belkin

Bias Considerations in Simulation Experiments pp. 785-790

George S. Fishman

A Model of a Traffic Jam Behind a Bottleneck pp. 791-799

Edward A. Brill

An Estimate of Expected Critical-Path Length in PERT Networks pp. 800-812

J. H. Lindsey

A Problem in Bulk Service Scheduling pp. 813-819

G. L. Nemhauser and P. L. Yu

Scheduling to Minimize the Variance of Holding Costs in Joint Production pp. 820-834

J. H. Fairhurst

An Algorithm for Project (Job) Sequencing with Resource Constraints pp. 835-850

Samuel Corenstein

Distribution of the Number of Tasks by a Repairable Machine pp. 851-859

Meckinley Scott

A Decomposition Algorithm for Arborescence Inventory Systems pp. 860-874

Basil A. Kalymon

Optimal Control Systems with Stochastic Boundary Conditions and State Equations pp. 875-887

Richard F. Baum

Reliability Estimation in Life Testing in the Presence of an Outlier Observation pp. 888-894

S. K. Sinha

Technical Note—A Scheduling Problem Involving Sequence Dependent Changeover Times pp. 895-902

A. G. Lockett and A. P. Muhlemann

Technical Note—Fixed-Stockout-Probability Order Quantities with Lost Sales and Time Lag pp. 903-904

Arthur Yaspan

Technical Note—Markov Decision Processes with State-Information Lag pp. 904-907

D. M. Brooks and C. T. Leondes

Technical Note—The Infinitely-Many-Server Queue with Semi-Markovian Arrivals and Customer-Dependent Exponential Service Times pp. 907-912

Woollcott Smith

Technical Note—On a Sequential Stopping Rule for Fixed-Sample Acceptance Tests pp. 913-914

R. E. Schafer

Volume 20, issue 3, 1972

Systems Problems in the City pp. 465-473

Peter L. Szanton

The Application of Multifunction Stochastic Service Systems in Allocating Ambulances to an Urban Area pp. 558-570

William K. Hall

Response Areas for Two Emergency Units pp. 571-594

Grace M. Carter, Jan M. Chaiken and Edward Ignall

On Insensitivities in Urban Redistricting and Facility Location pp. 595-612

Richard C. Larson and Keith A. Stevenson

A Method for Districting Among Facilities pp. 613-618

Ralph L. Keeney

A Network-Flow Model for Racially Balancing Schools pp. 619-628

Peter C. Belford and H. Donald Ratliff

A Spatial-Allocation Model for Regional Health-Services Planning pp. 629-642

William J. Abernathy and John C. Hershey

A Telephone-Access Biomedical Information Center pp. 643-667

J. A. Dei Rossi, G. F. Mills and G. C. Sumner

Solving Resource-Constrained Network Problems by Implicit Enumeration—Preemptive Case pp. 668-677

Linus Schrage

Maximal Flow with Gains through a Special Network pp. 678-688

John J. Jarvis and Anthony M. Jezior

Solution of the Flowshop-Scheduling Problem with No Intermediate Queues pp. 689-697

D. A. Wismer

Optimal Operating Policies for the Finite-Source Queuing Process pp. 698-707

N. K. Jaiswal and P. S. Simha

Technical Note—A Sample Survey of Operations-Research Activities at the Corporate Level pp. 708-721

Efraim Turban

Technical Note—Approximations to the Renewal Function m ( t ) pp. 722-727

David L. Jaquette

Errata pp. 728-728

Salvador B. Layno

Letter to the Editor—Operations Research and Management Science Today, or, Does an Education in Checkers Really Prepare One for a Life of Chess? pp. 729-737

R. E. D. Woolsey

Volume 20, issue 2, 1972

An Equilibrium Flow Model of a University Campus pp. 249-264

Robert M. Oliver and David S. P. Hopkins

Management of Seasonal Style-Goods Inventories pp. 265-275

Arunachalam Ravindran

Pluralization: A Mathematical Model pp. 276-292

Manfred Kochen and Karl W. Deutsch

Sequential Search for an Unknown Number of Objects of Nonuniform Size pp. 293-308

John M. Cozzolino

A Probabilistic Model for Optimal Project Scheduling pp. 309-317

Michael Rubinovitch

Generalization of White's Method of Successive Approximations to Periodic Markovian Decision Processes pp. 318-326

Shiaw Y. Su and Rolf A. Deininger

A Stochastic Constrained Optimal Replacement Model: The Case of Ship Replacement pp. 327-334

Peter J. Kalman

Some Reliability Fault-Testing Models pp. 335-343

Richard Butterworth

Expected Damaged Area for Stick and Triangular Pattern Bombing pp. 344-349

N. K. Jaiswal and P. P. Sangal

Stochastic Duels with Damage pp. 350-356

A. Nagabhushanam and G. C. Jain

Two Measures for Describing Queue Behavior pp. 357-372

U. Narayan Bhat

A Priority Queue with Low-Priority Arrivals General pp. 373-380

John A. Hooke

Some Heavy-Traffic Limit Theorems for a Priority Queue with General Arrivals pp. 381-388

John A. Hooke

Queues with Service in Random Order pp. 389-405

Grace M. Carter and Robert B. Cooper

Multilevel Bulk Service Queues pp. 406-420

Emil Bahary and Peter Kolesar

Queuing with Two Servers Working in Shifts pp. 421-424

Meckinley Scott

The Infinite-Server Queue with Poisson Arrivals and Semi-Markovian Services pp. 425-433

Marcel F. Neuts and Shun-Zer Chen

The Queue M / G /1 with the Semipreemptive-Priority Queuing Discipline pp. 434-439

Thomas M. O'Donovan

Queues with Periodic Service and Changeover Time pp. 440-451

Martin Eisenberg

Remark on a Service System with Mixed Input Streams pp. 452-454

Teresa Ryba

Volume 20, issue 1, 1972

Cost-of-Research Index, 1920–1970 pp. 1-18

Helen S. Milton

On Scheduling the Delivery of Babies pp. 19-23

Irwin W. Kabak

Single-Server, Two-Machine Sequencing with Switching Time pp. 24-36

Vinod K. Sahney

Games of Economic Survival with Discrete- and Continuous-Income Processes pp. 37-45

Hans U. Gerber

Letter to the Editor—Implementation of an OR Approach for Forming Efficient Election Districts pp. 46-48

E. S. Savas, Harry Lipton and Leonora Burkholz

Technical Note—Some Comments on Engel's “A Verification of Lanchester's Law” pp. 49-52

Robert W. Samz

Technical Note—Asymptotic Properties of Mean Length Estimators for Finite Markov Queues pp. 52-57

John F. Reynolds

Primal Decomposition of Mathematical Programs by Resource Allocation: I—Basic Theory and a Direction-Finding Procedure pp. 58-74

Gary J. Silverman

Primal Decomposition of Mathematical Programs by Resource Allocation: II—Computational Algorithm with an Application to the Modular Design Problem pp. 75-93

Gary J. Silverman

The Transportation-Location Problem pp. 94-108

Leon Cooper

A Noniterative Algorithm for Tridiagonal Transportation Problems and Its Generalization pp. 109-125

Benjamin Lev

Basic Dual Feasible Solutions for a Class of Generalized Networks pp. 126-136

Fred Glover, D. Klingman and A. Napier

On Refinements of Some Duality Theorems in Linear Programming over Cones pp. 137-142

K. O. Kortanek and A. L. Soyster

Extensions of the Evans-Gould Stability Theorems for Mathematical Programs pp. 143-153

Harvey J. Greenberg and William P. Pierskalla

An Algorithm for the Minimum-Risk Problem of Stochastic Programming pp. 154-164

Mihai Dragomirescu

Technical Note—Direct Proof of the Existence Theorem for Quadratic Programming pp. 165-167

E. Blum and W. Oettli

Technical Note—Finite Algorithms for Solving Quasiconvex Quadratic Programs pp. 167-173

W. Charles Mylander

Technical Note—A Branch-and-Bound Algorithm for Seeking the P -Median pp. 173-178

Pertti Järvinen, Jaakko Rajala and Heikki Sinervo

Technical Note—Strengthened Dantzig Cuts for Integer Programming pp. 178-182

David S. Rubin and Robert L. Graves

Technical Note—A Note on Zero-One Integer and Concave Programming pp. 182-183

V. Joseph Bowman and Fred Glover