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 33, issue 6, 1985

OR Practice—Analysis of the Economic Effect of the Alaskan Oil Export Ban pp. 1173-1202

Terrence Higgins and Hank C. Jenkins-Smith

Testing the Adequacy of Markov Chain and Mover-Stayer Models as Representations of Credit Behavior pp. 1203-1214

Halina Frydman, Jarl G. Kallberg and Duen-Li Kao

The Caterer Problem pp. 1215-1224

Wlodzimierz Szwarc and Marc E. Posner

Computational Experience in Solving Equilibrium Models by a Sequence of Linear Complementarity Problems pp. 1225-1250

Lars Mathiesen

The Minisum and Minimax Location Problems Revisited pp. 1251-1265

Pierre Hansen, Dominique Peeters, Denis Richard and Jacques Thisse

Refining the Diffusion Approximation for the M / G / m Queue pp. 1266-1277

David D. Yao

Dynamic, Non-Preemptive Priority Queues with General, Linearly Increasing Priority Function pp. 1278-1298

Uttarayan Bagchi and Robert S. Sullivan

Reward Revision for Discounted Markov Decision Problems pp. 1299-1315

Chelsea C. White, Lyn C. Thomas and William T. Scherer

Establishing Consistent and Realistic Reorder Intervals in Production-Distribution Systems pp. 1316-1341

William L. Maxwell and John A. Muckstadt

A Cost Adjustment Heuristic for Dynamic Lot-Sizing with Uncertain Demand Timing pp. 1342-1352

Christopher H. Nevison

Bounds for Assembly Line Balancing Heuristics pp. 1353-1359

Maurice Queyranne

Preemptive Scheduling to Minimize Maximum Completion Time on Uniform Processors with Memory Constraints pp. 1360-1380

Charles Martel

Scheduling Jobs with Exponentially Distributed Processing Times and Intree Precedence Constraints on Two Parallel Machines pp. 1381-1388

Michael Pinedo and Gideon Weiss

Technical Note—An Improved Implementation of Conditional Monte Carlo Estimation of Path Lengths in Stochastic Networks pp. 1389-1393

V. G. Kulkarni and J. S. Provan

Technical Note—A Note on “Myopic Solutions of Markovian Decision Processes and Stochastic Games” pp. 1394-1398

Peter Köchel

Volume 33, issue 5, 1985

Computing Market Equilibria with Price Regulations Using Mathematical Programming pp. 935-954

Harvey J. Greenberg and Frederic H. Murphy

Evaluating Decision Strategies for Equity of Public Risks pp. 955-970

Ralph L. Keeney and Robert L. Winkler

An Analytic Derivation of Blackjack Win Rates pp. 971-988

Gary Gottlieb

Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs pp. 989-1007

John Birge

Sensitivity Analysis for Branch and Bound Integer Programming pp. 1008-1023

Linus Schrage and Laurence Wolsey

Using Confidence Limits for the Global Optimum in Combinatorial Optimization pp. 1024-1049

Ulrich Derigs

Optimal Routing under Capacity and Distance Restrictions pp. 1050-1073

Gilbert Laporte, Yves Nobert and Martin Desrochers

Using Block Norms for Location Modeling pp. 1074-1090

James E. Ward and Richard E. Wendell

Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics pp. 1091-1106

L. R. Foulds, P. B. Gibbons and J. W. Giffin

Regenerative Analysis and Steady State Distributions for Markov Chains pp. 1107-1116

Winfried K. Grassmann, Michael I. Taksar and Daniel P. Heyman

Stochastic Decompositions in the M / G /1 Queue with Generalized Vacations pp. 1117-1129

S. W. Fuhrmann and Robert B. Cooper

Optimal Policy for a Two-Stage Assembly System under Random Demand pp. 1130-1145

Charles P. Schmidt and Steven Nahmias

On Pinedo's Conjecture for Scheduling in a Stochastic Flow Shop pp. 1146-1153

S. Suresh, R. D. Foley and S. Elizabeth Dickey

Technical Note—Some Very Easy Knapsack/Partition Problems pp. 1154-1160

James B. Orlin

Volume 33, issue 4, 1985

Radiotherapy Treatment Design Using Mathematical Programming Models pp. 705-725

David Sonderman and Philip G. Abrahamson

Integer Prim-Read Solutions to a Class of Target Defense Problems pp. 726-745

Stefan A. Burr, James E. Falk and Alan F. Karr

Optimal Server Location on a Network Operating as an M / G /1 Queue pp. 746-771

Oded Berman, Richard C. Larson and Samuel S. Chiu

ε-Approximations for Multidimensional Weighted Location Problems pp. 772-783

Zvi Drezner and Bezalel Gavish

The Solution of Distance Constrained Mini-Sum Location Problems pp. 784-802

C. D. T. Watson-Gandy

Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models pp. 803-819

Ellis L. Johnson, Michael M. Kostreva and Uwe H. Suhl

Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment pp. 820-834

A. K. Chakravarty, J. B. Orlin and U. G. Rothblum

A Parametric Method for Solving the Linear Fractional Programming Problem pp. 835-841

Hartmut Wolf

Valid Linear Inequalities for Fixed Charge Problems pp. 842-861

M. W. Padberg, T. J. Van Roy and L. A. Wolsey

Bounding the Project Completion Time Distribution in PERT Networks pp. 862-881

Bajis Dodin

The Optimality of Unbalancing Both Workloads and Machine Group Sizes in Closed Queueing Networks of Multiserver Queues pp. 882-910

Kathryn E. Stecke and James J. Solberg

Explicit Solutions of M / G / C / / N -type Queueing Loops with Generalizations pp. 911-927

Lester Lipsky

Technical Note—On Generating Cutting Planes from Combinatorial Disjunctions pp. 928-933

Hanif D. Sherali and Suvrajeet Sen

Volume 33, issue 3, 1985

Distribution Strategies that Minimize Transportation and Inventory Costs pp. 469-490

Lawrence D. Burns, Randolph W. Hall, Dennis E. Blumenfeld and Carlos F. Daganzo

A Time-dependent Stopping Problem with Application to Live Organ Transplants pp. 491-504

Israel David and Uri Yechiali

Subset Coefficient Reduction Cuts for 0/1 Mixed-Integer Programming pp. 505-526

R. Kipp Martin and Linus Schrage

Signature Methods for the Assignment Problem pp. 527-536

Michel Balinski

An Algorithm for the Maximal Multicommodity Funnel-Node Flow in an Undirected Network pp. 537-547

Ernesto Q. V. Martins and Mario S. Rosa

On the Expected Relative Performance of List Scheduling pp. 548-561

E. G. Coffman and E. N. Gilbert

Minimizing Weighted Completion Times with Deadlines pp. 562-574

Marc E. Posner

Optimal Inventory Policies When Ordering Prices are Random pp. 575-588

Kamal Golabi

Iterative Aggregation-Disaggregation Procedures for Discounted Semi-Markov Reward Processes pp. 589-605

Paul J. Schweitzer, Martin L. Puterman and Kyle W. Kindle

A Concept of Monotonicity and Its Characterization for Closed Queueing Networks pp. 606-624

Rajan Suri

The Optimal Look-Ahead Policy for Admission to a Single Server System pp. 625-643

W. M. Nawijn

Optimal Control of an M / M / S Queueing System pp. 644-660

Donald S. Szarkowicz and Thomas W. Knowles

Efficiency of Multivariate Control Variates in Monte Carlo Simulation pp. 661-677

Reuven Y. Rubinstein and Ruth Marcus

Technical Note—On the Optimal Choice of Sizes pp. 678-684

Peter Tryfos

Technical Note—The Stochastic Discrete Dynamic Lot Size Problem: An Open-Loop Solution pp. 684-689

J. B. Lasserre, C. Bes and F. Roubellat

Technical Note—Optimal Scheduling of Periodic Activities pp. 690-695

Kyung S. Park and Doek K. Yun

Technical Note—A Note on the Stochastic Shortest Route Problem pp. 696-698

Jerzy Kamburowski

OR Forum—Careers in OR/MS; or, Life after the Ph.D.: A Student/Practitioner/Faculty Discussion pp. 699-703

R. Jean Ruth, Kathryn E. Stecke and Morris A. Cohen

Volume 33, issue 2, 1985

OR Forum—OR and the Airline Overbooking Problem pp. 237-248

Marvin Rothstein

Comparing Draws for Single Elimination Tournaments pp. 249-262

Jeff Horen and Raymond Riezman

Optimal Unemployment Insurance Policy pp. 263-276

Dror Zuckerman

Optimal Supply of a Depletable Resource with a Backstop Technology: Heal's Theorem Revisited pp. 277-292

Shmuel S. Oren and Stephen G. Powell

Equilibrium Analysis of Disaggregate Facility Choice Systems Subject to Congestion-Elastic Demand pp. 293-311

Hau Leung Lee and Morris A. Cohen

Optimal Ordering Strategies for Announced Price Increases pp. 312-325

Sam G. Taylor and Charles E. Bradley

The Deterministic Dynamic Product Cycling Problem pp. 326-345

Uday S. Karmarkar and Linus Schrage

A Generalized Uniform Processor System pp. 346-362

Hiroaki Ishii, Charles Martel, Teruo Masuda and Toshio Nishida

A Branch and Bound Algorithm for the Total Weighted Tardiness Problem pp. 363-377

Chris N. Potts and Luk N. Van Wassenhove

The Transient Behavior of the M / M / s Queue, with Implications for Steady-State Simulation pp. 378-396

W. David Kelton and Averill M. Law

The Push-Out-Priority Queue Discipline pp. 397-403

Daniel P. Heyman

Replacement of Systems and Components in Renewal Decision Problems pp. 404-411

L. C. Thomas

The Sequential Design of Bernoulli Experiments Including Switching Costs pp. 412-426

Michael Kolonko and Harald Benzing

Limits for the Precision and Value of Information from Dependent Sources pp. 427-442

Robert T. Clemen and Robert L. Winkler

Assessment of Preferences by Conditions on Pricing-Out Amounts pp. 443-454

Charles M. Harvey

Technical Note—The Effect of Risk Aversion on the Expected Value of Perfect Information pp. 455-458

Abraham Mehrez

Technical Note—Forest Outturn Optimization by Dantzig-Wolfe Decomposition and Dynamic Programming Column Generation pp. 459-464

G. Eng and H. G. Daellenbach

Technical Note—On Normalizing Constants in Queueing Networks pp. 464-468

P. G. Harrison

Volume 33, issue 1, 1985

Disappointment in Decision Making Under Uncertainty pp. 1-27

David E. Bell

Simultaneous Bidding with a Fixed Charge if Any Bid is Successful pp. 28-37

Stephen A. Smith and Michael H. Rothkopf

Ranking with Partial Information: A Method and an Application pp. 38-48

Craig W. Kirkwood and Rakesh K. Sarin

An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure pp. 49-64

John Beasley

A New Polynomially Bounded Shortest Path Algorithm pp. 65-73

F. Glover, D. Klingman and N. Phillips

Parametric Solution of Bicriterion Linear Fractional Programs pp. 74-84

A. R. Warburton

Geometric Programming: Estimation of Lagrange Multipliers pp. 85-93

M. J. Rijckaert and E. J. C. Walraven

Accuracy and Tactical Implications of Bearings-Only Ranging Algorithms pp. 94-103

Bernard J. McCabe

Comments on “Accuracy and Tactical Implications of Bearings-Only Ranging Algorithms” pp. 104-106

Alan R. Washburn and Peter H. Daly

Author's Rejoinder pp. 107-108

Bernard J. McCabe

A Stochastic Model of Personnel Mobility: Application of Reliability Theory in Manpower System Analysis pp. 109-125

Robert E. Stanford

The Comparison of Life Table and Markov Chain Techniques for Follow-up Studies pp. 126-133

John R. Schoenfelder, Richard H. Shachtman and Gordon J. Johnston

Numerical Comparisons of Inventory Policies for Periodic Review Systems pp. 134-152

Evan L. Porteus

Reliability Bounds for Multistate Systems with Multistate Components pp. 153-160

Joseph C. Hudson and Kailash C. Kapur

Tests for the Nonergodicity of Multidimensional Markov Chains pp. 161-167

Linn I. Sennott

A Queueing System with General-Use and Limited-Use Servers pp. 168-182

Linda Green

Explicit and Iterative Numerical Approaches to Solving Queueing Models pp. 183-202

Patricia M. Snyder and William J. Stewart

Further Results on Queues with Partial Correlation pp. 203-209

Nasser Hadidi

Technical Note—Measuring Equity in Public Risk pp. 210-217

Rakesh Kumar Sarin

Technical Note—Alternative Model Formulations in Nonlinear Programming—Some Disastrous Results pp. 218-221

Arne Drud

Technical Note—Construction of Difficult Linearly Constrained Concave Minimization Problems pp. 222-227

Bahman Kalantari

Technical Note—A Markov Chain Partitioning Algorithm for Computing Steady State Probabilities pp. 228-235

Theodore J. Sheskin