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.

Automated air load planning pp. 751-768: Kurt R. Heidelberg, Gregory S. Parnell and James E. Ames
Iterative methods for dynamic stochastic shortest path problems pp. 769-789: Raymond K. Cheung
Solving a selected class of location problems by exploiting problem structure: A decomposition approach pp. 791-815: Dilip Chhajed and Timothy J. Lowe
Decomposition algorithms for the maximum‐weight connected graph problem pp. 817-837: Heungsoon Felix Lee and Daniel R. Dooly
A set‐processing algorithm for scheduling staff on 4‐day or 3‐day work weeks pp. 839-853: Richard N. Burns, Rangarajan Narasimhan and L. Douglas Smith

Combat modeling of remotely targeted vehicles and a battery against a moving target pp. 645-667: Chang S. Sung and Young H. Sohn
Analysis of production lines with Coxian service times and no intermediate buffers pp. 669-685: H. T. Papadopoulos
Inventory management under random supply disruptions and partial backorders pp. 687-703: Antonio Arreola‐Risa and Gregory A. DeCroix
The open shop scheduling problem with a given sequence of jobs on one machine pp. 705-731: Y.M. Shafransky and V.A. Strusevich
A competitive genetic algorithm for resource‐constrained project scheduling pp. 733-750: Sönke Hartmann

Class scheduling algorithms for Navy training schools pp. 533-551: A. Apte, A. Jayasuriya, J. Kennington, I. Krass, R. Mohamed, S. Sorensen and J. Whitler
Local search methods for the discrete time/resource trade‐off problem in project networks pp. 553-578: Bert De Reyck, Erik Demeulemeester and Willy Herroelen
Coordinated replenishments from multiple suppliers with price discounts pp. 579-598: Siddhartha Syam and Bala Shetty
A single‐period, multi‐echelon stochastic model under a mix of assemble to order and assemble in advance policies pp. 599-614: Moncer Hariga
Analysis of the greedy approach in problems of maximum k‐coverage pp. 615-627: Dorit S. Hochbaum and Anu Pathria
A nonparametric approach to accelerated life testing under multiple stresses pp. 629-644: Karthik Devarajan and Nader Ebrahimi

Heuristics for multicomponent joint replacement: Applications to aircraft engine maintenance pp. 435-458: Wallace J. Hopp and Yar‐Lin Kuo
Efficient multinomial selection in simulation pp. 459-482: J. O. Miller, Barry L. Nelson and Charles H. Reilly
Optimal scheduling of reader—systems pp. 483-495: K. D. Glazebrook, V. G. Kulkarni and L. C. Puryear
Bolstering components for maximizing system lifetime pp. 497-509: Jie Mi
Scheduling deteriorating jobs to minimize makespan pp. 511-523: Wieslaw Kubiak and Steef van de Velde
Open shop scheduling to minimize the number of late jobs pp. 525-532: Christos Koulamas and George J. Kyparisis

An optimal structured policy for maintenance of partially observable aircraft engine components pp. 335-352: Wallace J. Hopp and Yar‐Lin Kuo
Locating a target from directional data pp. 353-364: Jingwen Li and Ser Aik Quek
On lifetimes in random environments pp. 365-375: Antonio Di Crescenzo and Franco Pellerey
Volume discount decisions: Wealth maximization or EOQ approach? pp. 377-389: Prafulla Joglekar and James M. Kelly
Some properties and computational results for a general repair process pp. 391-405: J. S. Dagpunar
Interchange fees for bank ATM networks pp. 407-417: S. H. Gow and L. C. Thomas
The dynamic lot size model with quantity discount: Counterexamples and correction pp. 419-422: Jiefeng Xu and Leonard L. Lu
Note: The economic manufacturing lot‐sizing problem with imperfect production processes: Bounds and optimal solutions pp. 423-433: M. Hariga and M. Ben‐Daya

Branch and bound methods for a search problem pp. 243-257: Alan R. Washburn
A continuous‐review inventory system with lost sales and variable lead time pp. 259-278: Esmail Mohebbi and Morton J.M. Posner
Solution algorithms for the parallel replacement problem under economy of scale pp. 279-295: Zhi‐Long Chen
Minimizing weighted mean absolute deviation of flow times in single machine systems pp. 297-311: Y. P. Aneja, S. N. Kabadi and A. Nagar
A new appointment rule for a single‐server, multiple‐customer service system pp. 313-326: Kum Khiong Yang, Mun Ling Lau and Ser Aik Quek
On the inspection game pp. 327-334: Thomas S. Ferguson and Costis Melolidakis

A robust regression technique using compound estimation pp. 125-139: James R. Simpson and Douglas C. Montgomery
An exact algorithm for the batch sequencing problem in a two‐machine flow shop with limited buffer pp. 141-164: A. Agnetis, F. Rossi and G. Gristina
Optimal lot sizing and inspection policy for an EMQ model with imperfect inspections pp. 165-186: Viliam Makis
Optimal control policies for a periodic review inventory system with emergency orders pp. 187-204: Chi Chiang and Genaro J. Gutierrez
Some comparison results of system availability pp. 205-218: Jie Mi
Improved upper bounds for the reliability of d‐dimensional consecutive‐k‐out‐of‐n: F systems pp. 219-230: Anant P. Godbole, Laura K. Potter and Jessica K. Sklar
Minimizing total completion time in two‐processor task systems with prespecified processor allocations pp. 231-242: Xiaoqiang Cai, Chung‐Yee Lee and Chung‐Lun Li

Attrition models of the Ardennes campaign pp. 1-22: Ronald D. Fricker
Matrix‐geometric solution of discrete time MAP/PH/1 priority queue pp. 23-50: Attahiru Sule Alfa
Openshop scheduling under linear resources constraints pp. 51-66: I. Adiri and O. Hamberg
Scheduling to minimize the total compression and late costs pp. 67-82: T.C.E. Cheng, Zhi‐Long Chen, Chung‐Lun Li and B.M.‐T. Lin
Pareto‐optimality in classical inventory problems pp. 83-98: J. Puerto and F.R. Fernández
Single machine sequencing with linear models of release dates pp. 99-113: Adam Janiak
Estimating reliability of components with increasing failure rate using series system data pp. 115-123: Paul H. Kvam and Harshinder Singh