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 39, issue 6, 1991

Habitual Domains pp. 869-876

P. L. Yu

A New Methodology for Military Force Structure Analysis pp. 877-885

Mark A. Gallagher and Elizabeth J. Kelly

A Taxonomy of Discrete Manufacturing Systems pp. 886-902

B. L. Dietrich

Methods for Solving Nonlinear Equations Used in Evaluating Emergency Vehicle Busy Probabilities pp. 903-916

Jeffrey Goldberg and Ferenc Szidarovszky

Driving Frequency Selection for Frequency Domain Simulation Experiments pp. 917-924

Sheldon H. Jacobson, Arnold H. Buss and Lee W. Schruben

Algorithms for Multiplex Bundling in a Telecommunications Network pp. 925-944

R. D. Doverspike

Shake-and-Bake Algorithms for Generating Uniform Points on the Boundary of Bounded Polyhedra pp. 945-954

C. G. E. Boender, R. J. Caron, J. F. McDonald, A. H. G. Rinnooy Kan, H. E. Romeijn, R. L. Smith, J. Telgen and Ton Vorst

A Strongly Polynomial Algorithm for a Special Class of Linear Programs pp. 955-960

I. Adler and S. Cosares

Sensitivity Analysis in Minisum Facility Location Problems pp. 961-969

Martine Labbé, Jacques Thisse and Richard E. Wendell

A State Aggregation Approach to Manufacturing Systems Having Machine States with Weak and Strong Interactions pp. 970-978

J. Jiang and Suresh Sethi

V-Shaped Policies for Scheduling Deteriorating Jobs pp. 979-991

Gur Mosheiov

Routing Printed Circuit Cards Through an Assembly Cell pp. 992-1004

Christopher B. Lofgren, Leon F. McGinnis and Craig A. Tovey

A Queueing Network Model for Analyzing a Class of Branch-and-Bound Algorithms on a Master–Slave Architecture pp. 1005-1017

O. J. Boxma and G. A. P. Kindervater

Truncation of Markov Chains with Applications to Queueing pp. 1018-1026

Nico M. van Dijk

Volume 39, issue 5, 1991

Introducing Students to Community Operations Research by Using a City Neighborhood As A Living Laboratory pp. 701-709

Steve M. Bajgier, Hazem D. Maragah, Michael S. Saccucci, Andrew Verzilli and Victor R. Prybutok

An Assessment Procedure for Simulation Models: A Case Study pp. 710-723

Christine A. Fossett, Dale Harrison, Harry Weintrob and Saul I. Gass

Structural Conditions for Perturbation Analysis Derivative Estimation: Finite-Time Performance Indices pp. 724-738

Paul Glasserman

Computing Cournot-Nash Equilibria pp. 739-748

Charles Kolstad and Lars Mathiesen

Market and Locational Equilibrium for Two Competitors pp. 749-756

Martine Labbé and S. Louis Hakimi

Formulating Two-Stage Stochastic Programs for Interior Point Methods pp. 757-770

Irvin J. Lustig, John M. Mulvey and Tamra J. Carpenter

On Finite Delay-Moment Conditions in Queues pp. 771-775

Ronald W. Wolff

A Cutting Plane Approach for Chance Constrained Linear Programs pp. 776-785

Andrés Weintraub and Jorge Vera

Decentralization for Multidivision Enterprises pp. 786-797

Cornelis van de Panne

Joint Optimal Planning of Industrial Cogeneration and Conventional Electricity Systems pp. 798-806

Y. H. Kwun and M. L. Baughman

Analysis of a Kanban Discipline for Cell Coordination in Production Lines, II: Stochastic Demands pp. 807-823

Debasis Mitra and Isi Mitrani

An Operation Partitioning Problem for Automated Assembly System Design pp. 824-835

Reza H. Ahmadi and Christopher S. Tang

Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date pp. 836-846

Nicholas G. Hall and Marc E. Posner

Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date pp. 847-856

Nicholas G. Hall, Wieslaw Kubiak and Suresh Sethi

A Comment on “Buffer Space Allocation in Automated Assembly Lines” pp. 857-860

John O. McClain and Douglas R. Moodie

Volume 39, issue 4, 1991

Operations Research in Industry: New Opportunities in a Changing World pp. 531-542

John D. C. Little

A Multilevel Analysis of Production Capabilities of the National Forest System pp. 543-552

John Hof and Tony Baltic

Aggregation and Disaggregation Techniques and Methodology in Optimization pp. 553-582

David F. Rogers, Robert D. Plante, Richard T. Wong and James R. Evans

Using Common Random Numbers and Control Variates in Multiple-Comparison Procedures pp. 583-591

Wei-Ning Yang and Barry L. Nelson

Value Functions When Decision Criteria Are Not Totally Substitutable pp. 592-600

Jayavel Sounderpandian

A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane pp. 601-615

Dimitris J. Bertsimas and Garrett van Ryzin

Capacitated Vehicle Routing on Trees pp. 616-622

Martine Labbé, Gilbert Laporte and Hélène Mercure

A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem pp. 623-632

Charles E. Noon and James C. Bean

Stationary Waiting Time Distribution of a Queue in Which Customers Require a Random Number of Servers pp. 633-638

Prawit Ittimakin and Edward P. C. Kao

Dominance and Decomposition Heuristics for Single Machine Scheduling pp. 639-647

Robert J. Chambers, Robert L. Carraway, Timothy J. Lowe and Thomas L. Morin

Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem pp. 648-653

Dorit S. Hochbaum and Ron Shamir

Finding Optimal (s, S) Policies Is About As Simple As Evaluating a Single Policy pp. 654-665

Yu-Sheng Zheng and A. Federgruen

Block Angular Structures and the Loading Problem in Flexible Manufacturing Systems pp. 666-676

Panagiotis Kouvelis and Hau L. Lee

Commonality Analysis Using Clustering Methods pp. 677-680

Lawrence Dale Thomas

C.P.M. Scheduling with Small Communication Delays and Task Duplication pp. 680-684

J. Y. Colin and P. Chrétienne

Volume 39, issue 3, 1991

Six (Or So) Things You Can Do with a Bad Model pp. 355-365

James S. Hodges

Decision Support for Supercomputer Acquisition pp. 366-377

Stephen D. Burd and Suleiman K. Kassicieh

Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning pp. 378-406

David S. Johnson, Cecilia R. Aragon, Lyle A. McGeoch and Catherine Schevon

Optimal Assignment of Components to Parallel-Series and Series-Parallel Systems pp. 407-414

V. Rajendra Prasad, K. P. K. Nair and Y. P. Aneja

Dynamic Search Games pp. 415-422

Lyn C. Thomas and Alan R. Washburn

An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes pp. 423-436

Alexander Shulman

Sufficient Conditions for Coincidence in Minisum Multifacility Location Problems with a General Metric pp. 437-442

O. Lefebvre, C. Michelot and F. Plastria

Capacitated Two-Stage Multi-Item Production/Inventory Model with Joint Setup Costs pp. 443-455

S. Anily and A. Federgruen

Parallel Savings Based Heuristics for the Delivery Problem pp. 456-469

Kemal Altinkemer and Bezalel Gavish

Matchup Scheduling with Multiple Resources, Release Dates and Disruptions pp. 470-483

James C. Bean, John Birge, John Mittenthal and Charles E. Noon

Off-Day Scheduling with Hierarchical Worker Categories pp. 484-495

Hamilton Emmons and Richard N. Burns

Optimal Manufacturing of a Two Product Mix pp. 496-501

Offer Kella

Some Effects of Nonstationarity on Multiserver Markovian Queueing Systems pp. 502-511

Linda Green, Peter Kolesar and Anthony Svoronos

Multi-Echelon Assembly Systems with Nonstationary Demands: Heuristics and Worst Case Performance Bounds pp. 512-518

Dev Joneja

How Many Forecasters Do You Really Have? Mahalanobis Provides the Intuition for the Surprising Clemen and Winkler Result pp. 519-523

Donald G. Morrison and David C. Schmittlein

Volume 39, issue 2, 1991

An Existence Theorem for OR/MS pp. 183-193

John A. White

The Application of Operations Research in the Optimization of Agricultural Production pp. 194-205

Zhao Qingzhen, Wang Changyu, Zhang Zhimin, Zhang Yunxiang and Wang Chuanjiang

Decision Analysis Applications in the Operations Research Literature, 1970–1989 pp. 206-219

James L. Corner and Craig W. Kirkwood

A Rapid Method for Optimization of Linear Systems with Storage pp. 220-232

C. H. Bannister and R. J. Kaye

Multi-Item Replenishment and Storage Problem (MIRSP): Heuristics and Bounds pp. 233-243

Shoshana Anily

Some Facets for an Assignment Problem with Side Constraints pp. 244-250

Ronny Aboudi and George L. Nemhauser

Interpolation Approximations of Sojourn Time Distributions pp. 251-260

Philip J. Fleming and Burton Simon

Optimal Scheduling of Inspections: A Delayed Markov Model with False Positives and Negatives pp. 261-273

Suleyman Özekici and Stanley R. Pliska

A Secretary Problem with Uncertain Employment and Best Choice of Available Candidates pp. 274-284

Mitsushi Tamaki

Minimax Resource Allocation with Tree Structured Substitutable Resources pp. 285-295

Rachelle S. Klein and Hanan Luss

Simultaneous Product-Mix Planning, Lot Sizing and Scheduling at Bottleneck Facilities pp. 296-307

Sin Hoon Hum and Rakesh K. Sarin

An (S − 1, S) Inventory System with Emergency Orders pp. 308-321

Kamran Moinzadeh and Charles P. Schmidt

Brownian Networks with Discretionary Routing pp. 322-340

Lawrence M. Wein

Optimal Data Verification Tests pp. 341-348

R. Avenhaus, H. P. Battenberg and B. J. Falkowski

Volume 39, issue 1, 1991

Knowledge and Economic Development pp. 5-8

Richard M. Cyert

Equilibrium Modeling, Analysis and Computation: The Contributions of Stella Dafermos pp. 9-12

Anna Nagurney

Natural Resource Land Management Planning Using Large-Scale Linear Programs: The USDA Forest Service Experience with FORPLAN pp. 13-27

Brian Kent, B. Bruce Bare, Richard C. Field and Gordon A. Bradley

Development and Use of a Modeling System to Aid a Major Oil Company in Allocating Bidding Capital pp. 28-41

Donald L. Keefer, F. Beckley Smith and Harry B. Back

The Line Segmentation Problem pp. 42-55

Reza H. Ahmadi and Hirofumi Matsuo

Computing Optimal Lot Sizes in the Economic Lot Scheduling Problem pp. 56-63

Paul H. Zipkin

Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights pp. 64-81

Esther M. Arkin and Robin O. Roundy

Optimal Pacing of Trains in Freight Railroads: Model Formulation and Solution pp. 82-99

David Kraay, Patrick T. Harker and Bintong Chen

Finite Dominating Sets for Network Location Problems pp. 100-118

J. N. Hooker, R. S. Garfinkel and C. K. Chen

On the Existence of a Feasible Flow in a Stochastic Transportation Network pp. 119-129

András Prékopa and Endre Boros

Structured Partitioning Problems pp. 130-149

S. Anily and A. Federgruen

An Algorithm for the Three-Index Assignment Problem pp. 150-161

Egon Balas and Matthew J. Saltzman

Computationally Feasible Bounds for Partially Observed Markov Decision Processes pp. 162-175

William S. Lovejoy