Free Access
Feature Article—Organizational Design: A Survey and an Approach

Pages:417–447

Published Online:June 1, 1981

https://doi.org/10.1287/opre.29.3.417

A New Optimization Method for Large Scale Fixed Charge Transportation Problems

Pages:448–463

Published Online:June 1, 1981

https://doi.org/10.1287/opre.29.3.448

Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria

Pages:464–484

Published Online:June 1, 1981

https://doi.org/10.1287/opre.29.3.464

Budget Constrained Optimization of Simulation Models via Estimation of Their Response Surfaces

Pages:485–500

Published Online:June 1, 1981

https://doi.org/10.1287/opre.29.3.485

A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering

Pages:501–510

Published Online:June 1, 1981

https://doi.org/10.1287/opre.29.3.501

Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops

Pages:511–522

Published Online:June 1, 1981

https://doi.org/10.1287/opre.29.3.511

On Locating a Facility to Service Areas within a Network

Pages:523–531

Published Online:June 1, 1981

https://doi.org/10.1287/opre.29.3.523

The Machine Repair Problem with Heterogeneous Populations

Pages:532–549

Published Online:June 1, 1981

https://doi.org/10.1287/opre.29.3.532

Models for Time-Sharing Computer Systems with Heterogeneous Users

Pages:550–566

Published Online:June 1, 1981

https://doi.org/10.1287/opre.29.3.550

Heavy-Traffic Limits for Queues with Many Exponential Servers

Pages:567–588

Published Online:June 1, 1981

https://doi.org/10.1287/opre.29.3.567

Using a Stochastic Model to Investigate Time to Absorption Distributions

Pages:589–603

Published Online:June 1, 1981

https://doi.org/10.1287/opre.29.3.589

On Stochastic Bounds for the Delay Distribution in the GI/G/s Queue

Pages:604–608

Published Online:June 1, 1981

https://doi.org/10.1287/opre.29.3.604

Free Access
Technical Note—An Efficient Approach to Some Cases of Coefficient Variations in Linear Programs

Pages:609–611

Published Online:June 1, 1981

https://doi.org/10.1287/opre.29.3.609

Free Access
Technical Note—The Multiperiod Knapsack Problem

Pages:612–616

Published Online:June 1, 1981

https://doi.org/10.1287/opre.29.3.612

Free Access
Technical Note—Equivalence between the Direct Search Approach and the Cut Approach to the Rectilinear Distance Location Problem

Pages:616–620

Published Online:June 1, 1981

https://doi.org/10.1287/opre.29.3.616

Free Access
Technical Note—Extension of the Luss-Gupta Resource Allocation Algorithm by Means of First Order Approximation Techniques

Pages:621–626

Published Online:June 1, 1981

https://doi.org/10.1287/opre.29.3.621

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.