Naval Research Logistics Quarterly

1954 - 1986

From John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().

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 18, issue 4, 1971

Control variable methods in the simulation of a model of a multiprogrammed computer system pp. 435-450

D. P. Gaver and G. S. Shedler

Models for multi‐item continuous review inventory policies subject to constraints pp. 451-463

D. A. Schrady and U. C. Choe

The bottleneck transportation problem pp. 465-472

R. S. Garfinkel and M. R. Rao

Some remarks on the time transportation problem pp. 473-485

Wlodzimierz Szwarc

Communication on “the bottleneck transportation problem” and “some remarks on the time transportation problem” pp. 487-490

Peter L. Hammer

Integer points on the Gomory fractional cut (hyperplane) pp. 491-496

Harvey M. Salkin and Patrice Breining

Determining the most vital link in a flow network pp. 497-502

S. H. Lubore, H. D. Ratliff and G. T. Sicilia

Optimal location of a single service center of certain types pp. 503-510

K. P. K. Nair and R. Chandrasekaran

Scheduling with earliest start and due date constraints pp. 511-519

Paul Bratley, Michael Florian and Pierre Robillard

Large deviation probabilities for order statistics pp. 521-523

Stephen A. Book

A bivariate normal theory maximum‐likelihood technique when certain variances are known pp. 525-530

Mitchell O. Locks

On the use of standard tables to obtain Dodge‐Romig LTPD sampling inspection plans pp. 531-542

William C. Guenther

A model for manpower productivity during organization growth pp. 543-559

John G. Rau

On models for business failure data pp. 561-566

Satya D. Dubey

A note on a comparison of confidence interval techniques in truncated life tests pp. 567-569

W. E. Coleman, T. Jayachandran and D. R. Barr

Volume 18, issue 3, 1971

Elimination methods in the m × n sequencing problem pp. 295-305

Wlodzimierz Szwarc

The fractional fixed‐charge problem pp. 307-315

Y. Almogy and O. Levin

A hybrid algorithm for the one machine sequencing problem to minimize total tardiness pp. 317-327

V. Srinivasan

On a sequential rule for estimating the location parameter of an exponential distribution pp. 329-337

A. P. Basu

A graph theoretic interpretation of the sufficiency conditions for the contiguous‐binary‐switching (CBS)‐rule pp. 339-344

Salah E. Elmaghraby

Political games pp. 345-355

Guillermo Owen

An application of linear programming to contingency planning: A tactical airlift system analysis pp. 357-378

David C. Dellinger

Allocation of carrier‐based attack aircraft using non‐linear programming pp. 379-393

Edward W. Rice, Jerome Brac Ken and Arthur W. Pennington

Dynamic programming approach to the optimization of Naval aircraft rework and replacement policies pp. 395-414

Arnold Neil Schwartz, James A. Sheler and Carl R. Cooper

A note on a first application of clustering procedures to fleet material condition measurements pp. 415-421

Henry Solomon

A note on adaptive boiler tube pulling pp. 423-427

J. W. Devanney

A note on a stochastic production‐maximizing transportation problem pp. 429-431

Uri Yechiali

Volume 18, issue 2, 1971

Operations analysis during the underwater search for Scorpions pp. 141-157

Henry R. Richardson and Lawrence D. Stone

Optimum sequential search with discrete locations and random acceptance errors pp. 159-167

Mark W. Smith and John E. Walsh

Information in two‐stage programming under uncertainty pp. 169-176

David P. Baron

Optimal control of multi‐channel service systems pp. 177-183

M. J. Magazine

The transportation paradox pp. 185-202

Wlodzimierz Szwarc

A backward recursive technique for optimal sequential sampling plans pp. 203-213

A. W. Wortham and E. B. Wilson

The interface of computer science and statistics pp. 215-229

A. F. Goodman

Statistical concepts in computational mathematics pp. 231-242

M. L. Juncosa

Extended iterative weighted least squares: Estimation of a linear model in the presence of complications pp. 243-276

A. F. Goodman

The lower bounded and partial upper bounded distribution model pp. 277-281

A. Charnes, Fred Glover and D. Klingrman

Hit probability for a chain‐like series of shots—a simple formula pp. 283-293

T. U. Zahle

Volume 18, issue 1, 1971

Tree‐search algorithms for quadratic assignment problems pp. 1-36

J. F. Pierce and W. B. Crowston

Optimal interdiction policy for a flow network pp. 37-45

P. M. Ghare, D. C. Montgomery and W. C. Turner

(0, 1) hyperbolic programming problems pp. 47-57

Pierre Robillard

Application of the GLM technique to a production planning problem pp. 59-74

J. P. Evans and F. J. Gould

Sequencing many jobs on a multi‐purpose facility pp. 75-82

John A. Buzacott and Sujit K. Dutta

Location of facilities with rectangular distances among point and area destinations pp. 83-90

G. O. Wesolowsky and R. F. Love

A technique which combines modified pattern search methods with composite designs and polynomial constraints to solve constrained optimization problems pp. 91-98

B. F. Houston and R. A. Huffman

Finite statistical games and linear programming pp. 99-102

Robert A. Agnew and Roy B. Hempley

On queues with state‐dependent Erlang service pp. 103-110

Carl M. Harris

Asymptotic inference about a density function at an end of its range pp. 111-114

Lionel Weiss

Optimal policies for a multi‐echelon inventory system with demand forecasts pp. 115-118

Donald L. Iglehart and Richard C. Morey

Simulation of multi‐echelon macro‐inventory policies pp. 119-134

Sheldon E. Haber

A note on a paper by W. Szwarc pp. 135-138

T. S. Arthanari and A. C. Mukhopadhyay

News and memoranda pp. 139-139

P. A. W. Lewis