Stochastic Horizons for the Aggregate Planning Problem

Pages:485–497

Published Online:January 1, 1978

https://doi.org/10.1287/mnsc.24.5.485

A Multiple-Objective Policy Model: Results of an Application to a Developing Country

Pages:498–509

Published Online:January 1, 1978

https://doi.org/10.1287/mnsc.24.5.498

Grouping Observations in Digital Simulation

Pages:510–521

Published Online:January 1, 1978

https://doi.org/10.1287/mnsc.24.5.510

A Diffusion Approximation to the Multi-Server Queue

Pages:522–529

Published Online:January 1, 1978

https://doi.org/10.1287/mnsc.24.5.522

The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution

Pages:530–534

Published Online:January 1, 1978

https://doi.org/10.1287/mnsc.24.5.530

Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph

Pages:535–544

Published Online:January 1, 1978

https://doi.org/10.1287/mnsc.24.5.535

Optimization of Priority Queues—A Semi-Markov Decision Chain Approach

Pages:545–553

Published Online:January 1, 1978

https://doi.org/10.1287/mnsc.24.5.545

A Renewal Decision Problem

Pages:554–561

Published Online:January 1, 1978

https://doi.org/10.1287/mnsc.24.5.554

Free Access
Note—On “A Renewal Decision Problem”

Pages:562–563

Published Online:January 1, 1978

https://doi.org/10.1287/mnsc.24.5.562

An HMMS Type Interactive Model for Aggregate Planning

Pages:564–575

Published Online:January 1, 1978

https://doi.org/10.1287/mnsc.24.5.564

Free Access
Note—A Note on Dynamic Programming with Unbounded Rewards

Pages:576–580

Published Online:January 1, 1978

https://doi.org/10.1287/mnsc.24.5.576

Free Access
Note—More on Planning for Freedom

Pages:581–584

Published Online:January 1, 1978

https://doi.org/10.1287/mnsc.24.5.581

Free Access
Notes About Authors

Pages:585–586

Published Online:January 1, 1978

https://doi.org/10.1287/mnsc.24.5.585

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.