Naval Research Logistics (NRL)

1987 - 2021

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 42, issue 8, 1995

Facility location and capacity acquisition: An integrated approach pp. 1141-1160

Vedat Verter and M. Cemal Dincer

Consistency of several variants of the standardized time series area variance estimator pp. 1161-1176

Halim Damerdji and David Goldsman

A search game on the union of graphs with immobile hider pp. 1177-1189

Ljiljana Pavlović

Weak order stability under risk pp. 1191-1201

Thomas Kämpke

Use of a classifier in a knowledge‐based simulation optimization system pp. 1203-1232

Ingrid W. M. Crouch, Allen G. Greenwood and Loren Paul Rees

Distributions of manufacturer's and user's replacement costs under warranty pp. 1233-1250

Izzet Sahin and Hakan Polatoglu

A note on minimizing the expected makespan in flowshops subject to breakdowns pp. 1251-1262

Charles Du and Michael Pinedo

Minimizing the weighted sum of quadratic completion times on a single machine pp. 1263-1270

Federico Della Croce, Wlodzimierz Szwarc, Roberto Tadei, Paolo Baracco and Raffaele di Tullio

Volume 42, issue 7, 1995

Multiperiod resource allocation with a smoothing objective pp. 1007-1020

Hanan Luss and Moshe B. Rosenwein

Optimal cutoff strategies in capacity expansion problems pp. 1021-1039

Michael Monticino and James Weisinger

Gittins‐index heuristics for research planning pp. 1041-1062

K. D. Glazebrook and R. W. Owen

A replacement model with overhauls and repairs pp. 1063-1079

Xiao‐Gao Liu, Viliam Makis and Andrew K. S. Jardine

An economic two‐stage screening procedure with a prescribed outgoing quality in logistic and normal models pp. 1081-1097

Do Sun Bai, Hyuck Moo Kwon and Min Koo Lee

The evolution of a selection system pp. 1099-1108

R. R. Read

Optimal timing schedules in earliness‐tardiness single machine sequencing pp. 1109-1114

Wlodzimierz Szwarc and Samar K. Mukhopadhyay

An exact aggregation/disaggregation algorithm for large scale markov chains pp. 1115-1128

David S. Kim and Robert L. Smith

Note: A local‐search heuristic for large set‐covering problems pp. 1129-1140

Larry W. Jacobs and Michael J. Brusco

Volume 42, issue 6, 1995

Optimal force mix in heterogeneous combat pp. 873-887

N. K. Jaiswal, Meena Kumari and B. S. Nagabhushana

Single‐stage, multi‐product production/inventory systems with lost sales pp. 889-913

Tayfur Altiok and Goang An Shiue

The single period procurement problem where dedicated supplier capacity can be reserved pp. 915-934

Karuna Jain and Edward A. Silver

Makespan minimization for m parallel identical processors pp. 935-948

Johnny C. Ho and Johnny S. Wong

Scheduling to minimize release‐time resource consumption and tardiness penalties pp. 949-966

Chung‐Lun Li, Edward C. Sewell and T. C. E. Cheng

Restricted planar location problems and applications pp. 967-992

H. W. Hamacher and S. Nickel

A suboptimality bound for permutation policies in single machine stochastic scheduling pp. 993-1005

K. D. Glazebrook

Volume 42, issue 5, 1995

Scheduling target illuminators in naval battle‐group anti‐air warfare pp. 737-755

Hanif D. Sherali, Youngho Lee and Donald D. Boyer

Some comments on the optimal assembly problem pp. 757-771

Frank K. Hwang and Uriel G. Rothblum

Strategic investment to reduce setup times in the economic lot scheduling problem pp. 773-790

Guillermo Gallego and Ilkyeong Moon

A primal‐dual algorithm for the dynamic lotsizing problem with joint set‐up costs pp. 791-806

Ömer Kirca

Approximate evaluation of batch‐ordering policies for a one‐warehouse, N non‐identical retailer system under compound poisson demand pp. 807-819

Sven Axsäter

Short‐term retrenchment planning in hierarchical manpower systems pp. 821-837

Jayaram K. Sankaran

An (s, q) inventory model with stochastic and interrelated lead times pp. 839-859

Ruud Heuts and Jan de Klein

Assemble to order and assemble in advance in a single‐period stochastic environment pp. 861-872

Amit Eynan and Meir J. Rosenblatt

Volume 42, issue 4, 1995

Simple probability models for assessing the value of information in defense against missile attack pp. 535-547

Rui Almeida, Donald P. Gaver and Patricia A. Jacobs

Quick‐response assessment of forward air control and communications using a queueing model and digital simulation pp. 549-557

Douglas A. Samuelson and Robert L. Sims

Lanchester models of the ardennes campaign pp. 559-577

Jerome Bracken

Lanchester modeling and the biblical account of the battles of gibeah pp. 579-584

Israel David

A mathematical model of attrition data pp. 585-607

Dean S. Hartley

Validating Lanchester's square law and other attrition models pp. 609-633

Dean S. Hartley and Robert L. Helmbold

Rates of advance in land combat operations pp. 635-669

Robert L. Helmbold

Use of the amphibious warfare model to evaluate the cost effectiveness of alternative marine corps amphibious assault vehicles pp. 671-690

George Akst

The combat simulation of desert storm with applications for contingency operations pp. 691-713

Jeffrey A. Appleget

Analysis of air operations during DESERT SHIELD and DESERT STORM pp. 715-736

Frederic T. Case, Christopher W. Hines and Steven N. Satchwell

Volume 42, issue 3, 1995

A proposed foundation for a theory of combat pp. 311-343

C. J. Ancker

Attrition formulas for deterministic models of large‐scale combat pp. 345-373

Lowell Bruce Anderson

On weapons scores and force strengths pp. 375-395

Lowell Bruce Anderson and Frederic A. Miercort

Efficient concentration of forces, or how to fight outnumbered and win pp. 397-418

David L. Bitters

Termination decision rules in combat attrition models pp. 419-433

N. K. Jaiswal and B. S. Nagabhushana

“The influence of the numerical strength of engaged forces in their casualties,” by M. Osipov pp. 435-490

Robert L. Helmbold and Allan S. Rehm

A modified lanchester linear process calibrated to historical data pp. 491-501

John Richard Scales

A fast approximation of homogeneous stochastic combat pp. 503-533

J. Yang and A. V. Gafarian

Volume 42, issue 2, 1995

Introduction to the special issue on air‐land‐naval warfare models pp. 147-150

Jerome Bracken, Moshe Kress and Richard E. Rosenthal

An introduction to variable‐resolution modeling pp. 151-181

Paul K. Davis

Cutting some trees to see the forest: On aggregation and disaggregation in combat models pp. 183-208

Richard J. Hillestad and Mario L. Juncosa

Experiments in variable resolution combat modeling pp. 209-232

Richard Hillestad, John Owen and Don Blumenthal

A stochastic version of the concepts evaluation model (CEM) pp. 233-246

Ralph E. Johnson, Ernst K. Isensee and William T. Allison

A synthesis of methods for simulating vulnerability of armored vehicles pp. 247-265

Fǎnicǎ Gavril

A salvo model of warships in missile combat used to evaluate their staying power pp. 267-289

Wayne P. Hughes

The analysis of ship air defense: The simulation model SEAROADS pp. 291-309

Martin P. F. M. van Dongen and Joost Kos

Volume 42, issue 1, 1995

Scheduling peacetime rotation of Pakistan army units pp. 1-13

Robert F. Dell, Richard E. Rosenthal and Shafqat Baig

Search for an infiltrator pp. 15-26

Ljiljana Pavlovic

Criteria and approximate methods for path‐constrained moving‐target search problems pp. 27-38

Lyn C. Thomas and James N. Eagle

Service levels in distribution systems with random customer order size pp. 39-56

E. P. Chew and L. A. Johnson

Expressions for item fill rates in periodic inventory systems pp. 57-80

M. Eric Johnson, Hau L. Lee, Tom Davis and Robert Hall

Weighted vertex packing problem for specially structured geometric graphs pp. 81-102

Gang Yu, Panagiotis Kouvelis and Songjun Luo

Dual criteria preemptive open‐shop problems with minimum makespan pp. 103-121

George Vairaktarakis and Sartaj Sahni

The advantage of deeper pockets in Silverman's game on intervals pp. 123-140

Gerald A. Heuer and Ulrike Leopold‐Wildburger

Note: Open‐shop scheduling with release dates to minimize maximum lateness pp. 141-145

Hans Kellerer, Thomas Tautenhahn and Gerhard Woeginger