A Stochastic Service Network Model with Application to Hospital Facilities

Pages:1–22

Published Online:February 1, 1981

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

Optimal Policies for Data Base Reorganization

Pages:23–36

Published Online:February 1, 1981

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

Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function

Pages:37–48

Published Online:February 1, 1981

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

Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables

Pages:49–74

Published Online:February 1, 1981

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

Pricing Model for a Computer Center

Pages:75–94

Published Online:February 1, 1981

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

Allocation of a Perishable Product Inventory

Pages:95–107

Published Online:February 1, 1981

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

Ambushing Random Walks II: Continuous Models

Pages:108–120

Published Online:February 1, 1981

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

Ambushing Random Walks III: More Continuous Models

Pages:121–129

Published Online:February 1, 1981

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

The Secretary Problem with an Unknown Number of Options

Pages:130–145

Published Online:February 1, 1981

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

Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs

Pages:146–160

Published Online:February 1, 1981

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

On Single-Machine Scheduling with Precedence Relations and Linear or Discounted Costs

Pages:161–173

Published Online:February 1, 1981

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

An M/M/1 Dynamic Priority Queue with Optional Promotion

Pages:174–188

Published Online:February 1, 1981

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

Concurrent Task Systems

Pages:189–201

Published Online:February 1, 1981

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

Free Access
Technical Note—Waiting Time in a Continuous Review (s, S) Inventory System with Constant Lead Times

Pages:202–207

Published Online:February 1, 1981

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

Free Access
Technical Note—Integer Allocation Problems of Min-Max Type with Quasiconvex Separable Functions

Pages:207–211

Published Online:February 1, 1981

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

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.