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.

A two‐phase procedure for allotting geostationary orbital locations to communications satellites pp. 779-797: Charles H. Reilly, Clark A. Mount‐Campbell, Fernando Mata, Eric K. Walton, Eric A. Aebker and Curt A. Levis
Aircraft weapon budgeting pp. 799-816: Matthew S. Goldberg
Diffusion approximations for complex repair systems pp. 817-838: Donald L. Iglehart and Atam P. Lalchandani
Multivariate age‐dependent imperfect repair pp. 839-850: Shey‐Huei Sheu and William S. Griffith
Joint determination of optimum variable and attribute target means pp. 851-864: F.J. Arcelus and M.A. Rahim
On hazard rate processes pp. 865-876: Y. Kebir
Testing guaranteed exponentiality pp. 877-892: Ramalingam Shanmugam
Developing production schedules which balance part usage and smooth production loads for just‐in‐time production systems pp. 893-910: G.J. Miltenburg and T. Goldstein
Sandwich approximation of univariate convex functions with an application to separable convex programming pp. 911-924: Rainer E. Burkard, Horst W. Hamacher and Günter Rote
Multiobjective fractional programming duality theory pp. 925-933: C. Singh and M.A. Hanson

Optimal sequential replenishment of ships during combat pp. 637-668: S. E. Pilnick, K. D. Glazebrook and D. P. Gaver
Interactive optimization methodology for fleet scheduling pp. 669-677: William G. Nulty and H. Donald Ratliff
A descent approach to solving the complementary programming problem pp. 679-698: V. Venkateswaran
Economic lot scheduling of fully loaded processes with external setups pp. 699-713: Robert R. Inman, Philip C. Jones and Guillermo M. Gallego
A proof for the longest‐job‐first policy in one‐machine scheduling pp. 715-720: T. C. E. Cheng and H. G. Kahlbacher
A single‐machine problem with multiple criteria pp. 721-727: Ali S. Kiran and Ali Tamer Unal
A planning horizon algorithm for deterministic inventory management with piecewise linear concave costs pp. 729-742: Alain Bensoussan, Jean‐Marie Proth and Maurice Queyranne
An analytic basis for decision support in negotiations pp. 743-761: Gregory E. Kersten, Wojtek Michalowski, David Cray and Ian Lee
Facility location when demand is time dependent pp. 763-777: Zvi Drezner and G. O. Wesolowsky

Editorial pp. 463-463: Richard E. Rosenthal
Introduction special issue on search theory pp. 465-468: Lawrence D. Stone and Alan R. Washburn
A survey of the search theory literature pp. 469-494: Stanley J. Benkoski, Michael G. Monticino and James R. Weisinger
Cumulative search‐evasion games pp. 495-510: James N. Eagle and Alan R. Washburn
An infiltration game on k arcs pp. 511-529: John M. Auger
Optimal search for a Markovian target pp. 531-554: Akira Ohsumi
Linear search with bounded resources pp. 555-565: R. D. Foley, T. P. Hill and M. C. Spruill
Dependence in target element detections induced by the environment pp. 567-577: Mark A. Youngren
Heterogeneous multitrunking queueing systems with thresholds pp. 579-597: Martin J. Fischer and Carl M. Harris
Bayesian inference of survival curve from record‐breaking observations: Estimation and asymptotic results pp. 599-609: Ram C. Tiwari and Jyoti N. Zalkikar
Estimation of the survival function of a repairable standby series system pp. 611-621: Z. Khalil, A. D. Dharmadhikari and B. H. Joshi
Nonlinear and unconstrained multiple‐objective optimization: Algorithm, computation, and application pp. 623-635: Asim Roy and Jyrki Wallenius

Optimal strategies for problems of simultaneous attack against an area defense without impact‐point prediction pp. 289-302: Norman T. O'Meara and Richard M. Soland
A two‐on‐one stochastic duel with maneuvering and fire allocation tactics pp. 303-313: Moshe Kress
A new heuristic solution method in resource‐constrained project scheduling pp. 315-331: Colin E. Bell and Jaemin Han
Minimizing flow time on a single machine with job classes and setup times pp. 333-350: A. J. Mason and E. J. Anderson
Parallel machine replacement pp. 351-365: Philip C. Jones, James L. Zydiak and Wallace J. Hopp
Heuristics for minimizing mean tardiness for m parallel machines pp. 367-381: Johnny C. Ho and Yih‐Long Chang
Dynamic scheduling in single‐server multiclass service systems with unit buffers pp. 383-396: Sid Browne and Uri Yechiali
Evaluation of base‐stock policies in multiechelon inventory systems with compound‐poisson demands pp. 397-412: Paul Zipkin
Distance‐directed augmenting path algorithms for maximum flow and parametric maximum flow problems pp. 413-430: Ravindra K. Ahuja and James B. Orlin
A branch‐and‐bound algorithm for flow‐path design of automated guided vehicle systems pp. 431-445: M. A. Venkataramanan and Kathryn A. Wilson
Optimal clustering: A model and method pp. 447-461: Gary Klein and Jay E. Aronson

Estimating a survival curve when new is better than used with respect to a distinguished set pp. 123-144: D. M. Reneau, F. J. Samaniego and R. A. Boyles
A cumulative damage shock model with imperfect preventive maintenance pp. 145-156: Masaaki Kijima and Toshio Nakagawa
A visual search model: The waiting time distribution of the number of fixations until detection pp. 157-170: Tony Lin
A generalized inspection game pp. 171-182: V. J. Baston and F. A. Bostock
Simulation of stochastic activity networks using path control variates pp. 183-201: Athanassios N. Avramidis, Kenneth W. Bauer and James R. Wilson
Timing replacement decisions under discontinuous technological change pp. 203-220: Wallace J. Hopp and Suresh K. Nair
Optimal inventory policies for substitutable commodities with stochastic demand pp. 221-240: Barry A. Pasternack and Zvi Drezner
Estimating travel distances by the weighted lp norm pp. 241-259: Jack Brimberg and Robert F. Love
Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs pp. 261-271: I. Adiri, E. Frostig and A. H. G. Rinnooy Kan
Scheduling of parallel processors: A posterior bound on LPT sequencing and a two‐step algorithm pp. 273-287: James D. Blocher and Suresh Chand

Editorial pp. i-i: Richard E. Rosenthal
Accelerated life test plans under intermittent inspection and type‐I censoring: The case of weibull failure distribution pp. 1-22: Sun‐Keun Seo and Bong‐Jin Yum
Designing an optimal life test with type I censoring pp. 23-32: Hiroaki Sandoh and Susumu Fujii
Bounds for circular error probabilities pp. 33-40: Y. S. Sathe, S. M. Joshi and S. P. Nabar
Probabilistic partial set covering problems pp. 41-51: Hanif D. Sherali, Seong‐In Kim and Edna L. Parrish
An exact ceiling point algorithm for general integer linear programming pp. 53-69: Robert M. Saltzman and Frederick S. Hillier
Vector processing approach to constrained network problems pp. 71-85: M. A. Venkataramana, John J. Dinkel and John Mote
Inventory rotation policies for slow moving items pp. 87-105: John W. Bradford and Paul K. Sugrue
Future supply uncertainty in EOQ models pp. 107-121: Mahmut Parlar and Defne Berkin