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 26, issue 6, 1978

A Mathematical Model Used to Analyze Breast Cancer Screening Strategies pp. 937-955

Michael Shwartz

Internal Telephone Billing Rates—A Novel Application of Non-Atomic Game Theory pp. 956-965

Louis J. Billera, David C. Heath and Joseph Raanan

Optimal Jury Selection: A Game-Theoretic Model for the Exercise of Peremptory Challenges pp. 966-991

Steven Brams and Morton D. Davis

A Dual-Based Procedure for Uncapacitated Facility Location pp. 992-1009

Donald Erlenkotter

A Probabilistic Model of Winners' Outs versus Losers' Outs Rules in Basketball pp. 1010-1019

S. Christian Albright and Wayne Winston

Design of a Computerized Message-Switching Center pp. 1020-1032

S. Stashevsky and I. Adiri

A Preference Order Dynamic Program for a Stochastic Traveling Salesman Problem pp. 1033-1045

Edward P. C. Kao

Universal Planning Horizons for Generalized Convex Production Scheduling pp. 1046-1058

Thomas E. Morton

Decomposition and Customer Streams of Feedback Networks of Queues in Equilibrium pp. 1059-1072

Frederick J. Beutler and Benjamin Melamed

Technical Note—A Modified Conjugate Gradient Algorithm pp. 1073-1078

Avinoam Perry

Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties pp. 1079-1082

Sankaran Lakshminarayan, Ram Lakshmanan, Robert L. Papineau and Rene Rochette

Technical Note—Some Simpler Bounds on the Mean Queuing Time pp. 1083-1088

William G. Marchal

Technical Note—Optimality of Monotonic Policies for Multiple-Server Exponential Queuing Systems with State-Dependent Arrival Rates pp. 1089-1094

Wayne Winston

Volume 26, issue 5, 1978

Data Structures and Computer Science Techniques in Operations Research pp. 686-717

B. L. Fox

Combinatorial Problems: Reductibility and Approximation pp. 718-759

Sartaj Sahni and Ellis Horowitz

Bin Packing with Geometric Constraints in Computer Network Design pp. 760-772

A. K. Chandra, D. S. Hirschberg and C. K. Wong

Automatic Categorization of Optimization Problems: An Application of Computer Symbolic Mathematics pp. 773-788

David R. Stoutemyer

A Performance Model for Computer Data-Base Reorganization Performed Concurrently with Usage pp. 789-804

Gary H. Sockut

Toward an Optimal Design of a Network Database from Relational Descriptions pp. 805-823

Prabuddha De, William D. Haseman and Charles H. Kriebel

A Dynamic Optimization Model for Distributed Databases pp. 824-835

K. Dan Levin and Howard Lee Morgan

A Combinatorial Approach to Dynamic Scheduling Problems pp. 836-844

Zaw-Sing Su and Kenneth C. Sevcik

An Analytical Treatment of Policy Function Schedulers pp. 845-863

Manfred Ruschitzka

A Class of FIFO Queues Arising in Computer Systems pp. 864-880

Edward G. Coffman and Micha Hofri

A Processor Utilization Model for a Multiprocessor Computer System pp. 881-895

Richard E. Nance and U. Narayan Bhat

Simulation of Response Times in Finite-Capacity Open Networks of Queues pp. 896-914

Donald L. Iglehart and Gerald S. Shedler

Some Experimental Observations on the Behavior of Composite Random Number Generators pp. 915-935

Richard E. Nance and Claude Overstreet

Volume 26, issue 4, 1978

A Computer-Assisted System for the Routing and Scheduling of Street Sweepers pp. 525-537

Lawrence D. Bodin and Samuel J. Kursh

Optimal Design of Regional Wastewater Systems: A Fixed-Charge Network Flow Model pp. 538-550

John J. Jarvis, Ronald L. Rardin, V. E. Unger, Richard W. Moore and Charles C. Schimpeler

On Optimal Regulation Policies for Certain Multi-Reservoir Systems pp. 551-562

S. Arunkumar and K. Chon

Minimization of Time-Varying Costs in Single-Machine Scheduling pp. 563-569

E. L. Lawler and B. D. Sivazlian

Distance Constraints for Tree Network Multifacility Location Problems pp. 570-596

Richard L. Francis, Timothy J. Lowe and H. Donald Ratliff

On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem pp. 597-609

Lawrence M. Ostresh

Evaluating Offensive Performance in Baseball pp. 610-619

Mark D. Pankin

Existence of Optimal Simple Policies for Discounted-Cost Inventory and Cash Management in Continuous Time pp. 620-636

George Constantinides and Scott F. Richard

Protective Planning-Horizon Procedures for a Deterministic Cash Balance Problem pp. 637-652

J. Mensching, S. Garstka and T. Morton

Optimal Repair of a Series System pp. 653-662

Donald R. Smith

A Bayesian Estimation of the Reliability of Coherent Structures pp. 663-672

David V. Mastran and Nozer D. Singpurwalla

Technical Note—A Single-Commodity Transformation for Certain Multicommodity Networks pp. 673-680

James R. Evans

Technical Note—A General Inner Approximation Algorithm for Nonconvex Mathematical Programs pp. 681-683

Barry R. Marks and Gordon P. Wright

Volume 26, issue 3, 1978

On the Optimum Use of Incarceration for Crime Control pp. 381-405

Alfred Blumstein and Daniel Nagin

Testing the Accuracy, Usefulness, and Significance of Probabilistic Choice Models: An Information-Theoretic Approach pp. 406-421

John R. Hauser

A Cut Approach to the Rectilinear Distance Facility Location Problem pp. 422-433

Jean-Claude Picard and H. Donald Ratliff

Some Examples of Difficult Traveling Salesman Problems pp. 434-443

C. H. Papadimitriou and K. Steiglitz

Dynamic Programming Solution of Sequencing Problems with Precedence Constraints pp. 444-449

Linus Schrage and Kenneth R. Baker

Optimum Advertising and Goodwill under Uncertainty pp. 450-463

Charles S. Tapiero

The Fixed-Charge Perishable Inventory Problem pp. 464-481

Steven Nahmias

Maximum Return from a Collection of Standard and Special Appreciating Assets pp. 482-491

Mark R. Lembersky

The Output of Multiserver Queuing Systems pp. 492-509

Charles D. Pack

Approximations for the M / G / m Queue pp. 510-523

Per Hokstad

Volume 26, issue 2, 1978

A Survey of Linear Cost Multicommodity Network Flows pp. 209-236

Jeff L. Kennington

Using Simulation to Develop and Validate Analytic Models: Some Case Studies pp. 237-253

Edward J. Ignall, Peter Kolesar and Warren E. Walker

An Interactive Multiple-Objective Linear Programming Approach to a Problem in Forest Management pp. 254-269

Ralph E. Steuer and Albert T. Schuler

Optimum Solution Structure for a Repairable Inventory Problem pp. 270-281

Vincent P. Simpson

The Optimal Control of Partially Observable Markov Processes over the Infinite Horizon: Discounted Costs pp. 282-304

Edward J. Sondik

Minimizing a Submodular Function on a Lattice pp. 305-321

Donald M. Topkis

Interactive Identification and Optimization Using a Binary Preference Relation pp. 322-332

Donald A. Wehrung

Approximate Transient Analysis of Some Queuing Systems pp. 333-346

T. C. T. Kotiah

Technical Note—On the Expected Performance of Branch-and-Bound Algorithms pp. 347-349

J. K. Lenstra and A. H. G. Rinnooy Kan

Technical Note—Accelerated Computation of the Expected Discounted Return in a Markov Chain pp. 350-358

Evan L. Porteus and John C. Totten

Technical Note—An Implementation of Surrogate Constraint Duality pp. 358-364

John J. Dinkel and Gary A. Kochenberger

Technical Note—Dynamic Generalized Upper Bounding pp. 365-369

Richard D. McBride

Letter to the Editor—Comments on a Note by Hatch on Network Algorithms pp. 370-374

Fred Glover and Darwin Klingman

Letter to the Editor—On the Possibility of Cycling with the Simplex Method pp. 374-376

T. C. T. Kotiah and David I. Steinberg

Letter to the Editor—On “A ‘Hard’ Assignment Problem” by Machol and Wien pp. 376-376

Maurice Queyranne

Volume 26, issue 1, 1978

Performance Guarantees for Scheduling Algorithms pp. 3-21

M. R. Garey, R. L. Graham and D. S. Johnson

Complexity of Scheduling under Precedence Constraints pp. 22-35

J. K. Lenstra and A. H. G. Rinnooy Kan

Flowshop and Jobshop Schedules: Complexity and Approximation pp. 36-52

Teofilo Gonzalez and Sartaj Sahni

A General Bounding Scheme for the Permutation Flow-Shop Problem pp. 53-67

B. J. Lageweg, J. K. Lenstra and A. H. G. Rinnooy Kan

Minimal Resources for Fixed and Variable Job Schedules pp. 68-85

Ilya Gertsbakh and Helman I. Stern

The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling pp. 86-110

Jean-Claude Picard and Maurice Queyranne

Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks pp. 111-120

Kenneth R. Baker and Linus E. Schrage

A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times pp. 121-126

Hiroshi Kise, Toshihide Ibaraki and Hisashi Mine

On a Real-Time Scheduling Problem pp. 127-140

Sudarshan K. Dhall and C. L. Liu

Scheduling to Minimize Maximum Cumulative Cost Subject to Series-Parallel Precedence Constraints pp. 141-158

H. M. Abdel-Wahab and T. Kameda

The Single-Plant Mold Allocation Problem with Capacity and Changeover Restrictions pp. 159-165

Robert R. Love and R. R. Vemuganti

An Algorithm for the Space-Shuttle Scheduling Problem pp. 166-182

Marshall L. Fisher and Ramchandran Jaikumar

Scheduling Boats to Sample Oil Wells in Lake Maracaibo pp. 183-196

Elio Cunto

Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline pp. 197-199

Donald R. Smith

Technical Note—Improved Dominance Conditions for the Three-Machine Flowshop Scheduling Problem pp. 200-203

J. N. D. Gupta and S. S. Reddi

Technical Note—Dominance Conditions for the Three-Machine Flow-Shop Problem pp. 203-206

Wlodzimierz Szwarc

Technical Note—Three-Stage Flow-Shops with Recessive Second Stage pp. 207-208

Fennell Burns and John Rooker