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 29, issue 6, 1981

Feature Article—The Ellipsoid Method: A Survey pp. 1039-1091

Robert G. Bland, Donald Goldfarb and Michael Todd

A New Linear Programming Approach to the Cutting Stock Problem pp. 1092-1104

Harald Dyckhoff

Analysis of Preference Dependencies among Objectives pp. 1105-1120

Ralph L. Keeney

Optimal Smoothing Rules for University Financial Planning pp. 1121-1136

William F. Massy, Richard C. Grinold, David S. P. Hopkins and Alejandro Gerson

Supply-Demand Decomposition of the National Coal Model pp. 1137-1153

Michael H. Wagner

Optimal Whereabouts Search for a Moving Target pp. 1154-1166

Lawrence D. Stone and Joseph B. Kadane

Congestion Formulas for a Heterogeneous Server Loss System with Random Selection Discipline pp. 1167-1180

J. S. Kaufman

Optimal Preventive Maintenance Policies for Repairable Systems pp. 1181-1194

D. G. Nguyen and D. N. P. Murthy

Single Machine Scheduling with Series-Parallel Precedence Constraints pp. 1195-1207

R. N. Burns and Gerald Steiner

Technical Note—The Optimal Estimation of the Expected Number in a M / D /∞ Queueing System pp. 1208-1211

W. K. Grassmann

Technical Note—Further Results on an Infinite Capacity Shuttle with Control at a Single Terminal pp. 1212-1217

Howard J. Weiss

Technical Note—On Location Dominance on Spherical Surfaces pp. 1218-1219

Zvi Drezner

Technical Note—Bounds in the Generalized Weber Problem under Locational Uncertainty pp. 1219-1227

Henrik Juel

Technical Note—An Upper Bound Useful in Optimizing Search for a Moving Target pp. 1227-1230

Alan R. Washburn

Technical Note—A Note on the M / M /1 Queue with λ = μ pp. 1231-1234

Diego R. Roque

Technical Note—Analysis of a Preference Order Traveling Salesman Problem pp. 1234-1237

Moshe Sniedovich

Errata pp. 1238-1238

Edward P. C. Kao

Volume 29, issue 5, 1981

Dynamic Equilibrium Energy Modeling: The Canadian BALANCE Model pp. 829-852

Terrence E. Daniel and Henry M. Goldberg

Branch and Bound Methods for Multi-Item Scheduling pp. 853-864

Dennis J. Sweeney and Richard A. Murphy

Suboptimal Design for Large Scale, Multimodule Systems pp. 865-875

Chelsea C. White and Kent Schlussel

Modeling Natural Gas Regulatory Proposals Using the Project Independence Evaluation System pp. 876-902

Frederic H. Murphy, Reginald C. Sanders, Susan H. Shaw and Richard L. Thrasher

Exhaustible Resource Models: The Value of Information pp. 903-923

Hung-Po Chao

On Hedging and TRIAD Force Levels pp. 924-930

Jerry denBroeder and Dave Mitchell

Multiple Finite Production Rate Dynamic Lot Size Inventory Models pp. 931-944

Suresh Sethi and Suresh Chand

Computation of Steady-State Probabilities for M / M /1 Priority Queues pp. 945-958

Douglas R. Miller

Markov Chain Design Problems pp. 959-970

Richard V. Evans

Optimal Control of a Birth and Death Epidemic Process pp. 971-982

Claude Lefévre

The Design of Distributed Service Systems pp. 983-994

David R. Strip and Richard Engelbrecht-Wiggans

Myopic Solutions of Markov Decision Processes and Stochastic Games pp. 995-1009

Matthew J. Sobel

M / G /1 Queues with Scheduling within Generations and Removable Server pp. 1010-1018

J. G. Shanthikumar

A Mixed-Integer Goal Programming Model for Nursing Service Budgeting pp. 1019-1034

Vandankumar M. Trivedi

Volume 29, issue 4, 1981

Preface pp. 627-627

Arnoldo C. Hax, Thomas L. Magnanti and Linus E. Schrage

Operations Research in Inventory Management: A Review and Critique pp. 628-645

Edward A. Silver

A Review of Production Scheduling pp. 646-675

Stephen C. Graves

Operations Planning with VERT pp. 676-697

Gerald L. Moeller and Lester A. Digman

The Customer Contact Approach to Services: Theoretical Bases and Practical Extensions pp. 698-706

Richard B. Chase

Analytical Evaluation of Hierarchical Planning Systems pp. 707-716

M. A. H. Dempster, M. L. Fisher, L. Jansen, B. J. Lageweg, J. K. Lenstra and A. H. G. Rinnooy Kan

Hierarchical Production Planning: A Single Stage System pp. 717-743

Gabriel R. Bitran, Elizabeth A. Haas and Arnoldo C. Hax

Aggregation of Product Data for Hierarchical Production Planning pp. 744-756

Sven Axsäter

Equalization of Runout Times pp. 757-762

Uday S. Karmarkar

A Nonlinear Network Flow Algorithm for Maximization of Benefits in a Hydroelectric Power System pp. 763-786

Richard E. Rosenthal

The Multiregion Dynamic Capacity Expansion Problem, Part I pp. 787-799

C. O. Fong and V. Srinivasan

The Multiregion Dynamic Capacity Expansion Problem, Part II pp. 800-816

C. O. Fong and V. Srinivasan

International Intra-Company Transfer Pricing pp. 817-828

Suleiman K. Kassicieh

Volume 29, issue 3, 1981

Feature Article—Organizational Design: A Survey and an Approach pp. 417-447

Arnoldo C. Hax and Nicolas S. Majluf

A New Optimization Method for Large Scale Fixed Charge Transportation Problems pp. 448-463

Richard S. Barr, Fred Glover and Darwin Klingman

Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria pp. 464-484

T. L. Magnanti and R. T. Wong

Budget Constrained Optimization of Simulation Models via Estimation of Their Response Surfaces pp. 485-500

Andrew Daughety and Mark A. Turnquist

A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering pp. 501-510

John J. Bartholdi

Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops pp. 511-522

Yookun Cho and Sartaj Sahni

On Locating a Facility to Service Areas within a Network pp. 523-531

Peter J. Slater

The Machine Repair Problem with Heterogeneous Populations pp. 532-549

Donald Gross and John F. Ince

Models for Time-Sharing Computer Systems with Heterogeneous Users pp. 550-566

John P. Lehoczky and Donald P. Gaver

Heavy-Traffic Limits for Queues with Many Exponential Servers pp. 567-588

Shlomo Halfin and Ward Whitt

Using a Stochastic Model to Investigate Time to Absorption Distributions pp. 589-603

Richard H. Shachtman, John R. Schoenfelder and Carol J. Hogue

On Stochastic Bounds for the Delay Distribution in the GI / G / s Queue pp. 604-608

Ward Whitt

Technical Note—An Efficient Approach to Some Cases of Coefficient Variations in Linear Programs pp. 609-611

Andrés Weintraub and William Ingram

Technical Note—The Multiperiod Knapsack Problem pp. 612-616

Bruce H. Faaland

Technical Note—Equivalence between the Direct Search Approach and the Cut Approach to the Rectilinear Distance Location Problem pp. 616-620

Antoon Kolen

Technical Note—Extension of the Luss-Gupta Resource Allocation Algorithm by Means of First Order Approximation Techniques pp. 621-626

John M. Einbu

Volume 29, issue 2, 1981

The Multiperiod Multilocation Inventory Problem pp. 215-228

Uday S. Karmarkar

Decision Analysis in Microelectronic Reliability: Optimal Design and Packaging of a Diode Array pp. 229-242

Boaz Ronen and Joseph S. Pliskin

Market Equilibrium Computations in Activity Analysis Models pp. 243-262

Roger D. Norton and Pasquale Scandizzo

A Generalized Decision Support System Using Predicate Calculus and Network Data Base Management pp. 263-281

Robert H. Bonczek, Clyde W. Holsapple and Andrew B. Whinston

Equivalences and Continuity in Multivalent Preference Structures pp. 282-293

Peter H. Farquhar and Peter C. Fishburn

The Stationary Distribution of a Stochastic Clearing Process pp. 294-308

Ward Whitt

Optimal Survivor Search with Multiple States pp. 309-323

Joseph H. Discenza and Lawrence D. Stone

Determination of Optimal Variable-Sized Multiple-Block Appointment Systems pp. 324-345

Brant E. Fries and Vijay P. Marathe

The Deterrent Effect of Capital Punishment: A Test of Some Recent Studies pp. 346-370

Arnold Barnett

On the One-Dimensional Space Allocation Problem pp. 371-391

Jean-Claude Picard and Maurice Queyranne

The Median Residual Lifetime: A Characterization Theorem and an Application pp. 392-399

David C. Schmittlein and Donald G. Morrison

Technical Note—Precedence Relations of the Flow-Shop Problem pp. 400-411

Wlodzimierz Szwarc

Technical Note—Note on Constrained Maximization of a Sum pp. 411-414

Alan R. Washburn

Volume 29, issue 1, 1981

A Stochastic Service Network Model with Application to Hospital Facilities pp. 1-22

John C. Hershey, Elliott N. Weiss and Morris A. Cohen

Optimal Policies for Data Base Reorganization pp. 23-36

Haim Mendelson and Uri Yechiali

Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function pp. 37-48

James G. Morris

Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables pp. 49-74

Monique Guignard and Kurt Spielberg

Pricing Model for a Computer Center pp. 75-94

Yair M. Babad

Allocation of a Perishable Product Inventory pp. 95-107

Gregory P. Prastacos

Ambushing Random Walks II: Continuous Models pp. 108-120

William H. Ruckle

Ambushing Random Walks III: More Continuous Models pp. 121-129

William H. Ruckle and John R. Reay

The Secretary Problem with an Unknown Number of Options pp. 130-145

T. J. Stewart

Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs pp. 146-160

J. Wesley Barnes and Lawrence K. Vanston

On Single-Machine Scheduling with Precedence Relations and Linear or Discounted Costs pp. 161-173

K. D. Glazebrook and J. C. Gittins

An M / M /1 Dynamic Priority Queue with Optional Promotion pp. 174-188

Ehud Kofman and Steven A. Lippman

Concurrent Task Systems pp. 189-201

Errol L. Lloyd

Technical Note—Waiting Time in a Continuous Review ( s, S ) Inventory System with Constant Lead Times pp. 202-207

W. Karl Kruse

Technical Note—Integer Allocation Problems of Min-Max Type with Quasiconvex Separable Functions pp. 207-211

Zeev Zeitlin