The Design, Analysis and Implementation of Heuristics

Pages:263–265

Published Online:March 1, 1988

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

Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics

Pages:266–290

Published Online:March 1, 1988

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

Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space

Pages:291–305

Published Online:March 1, 1988

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

Minimum Spillage Sequencing

Pages:306–330

Published Online:March 1, 1988

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

Heuristics with Constant Error Guarantees for the Design of Tree Networks

Pages:331–341

Published Online:March 1, 1988

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

Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics

Pages:342–376

Published Online:March 1, 1988

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

A Heuristic Scheduling Policy for Multi-Item, Single-Machine Production Systems with Time-Varying, Stochastic Demands

Pages:377–390

Published Online:March 1, 1988

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

The Shifting Bottleneck Procedure for Job Shop Scheduling

Pages:391–401

Published Online:March 1, 1988

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

Free Access
Note—An Approximate Algorithm for Multidimensional Zero-One Knapsack Problems—A Parametric Approach

Pages:402–410

Published Online:March 1, 1988

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

Piecewise-Linear Approximation Methods for Nonseparable Convex Optimization

Pages:411–419

Published Online:March 1, 1988

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

An O(T2) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem

Pages:420–426

Published Online:March 1, 1988

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

Free Access
About Authors

Pages:427–429

Published Online:March 1, 1988

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

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.