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.

The effect of training data set size and the complexity of the separation function on neural network classification capability: The two‐group case pp. 699-717: Moshe Leshno and Yishay Spector
Labor staffing and scheduling models for controlling service levels pp. 719-740: Gary M. Thompson
An application of the MTP2 property on bounds on system reliability pp. 741-755: J. Gåsemyr and B. Natvig
A dynamic‐programming approach to continuous‐review obsolescent inventory problems pp. 757-774: Israel David, Eitan Greenshtein and Avraham Mehrez
Strong turnpike policies in the single‐item capacitated lot‐sizing problem with periodical dynamic parameter pp. 775-790: Stanislaw Bylka
An optimal recursive method for various inventory replenishment models with increasing demand and shortages pp. 791-806: Jinn‐Tsair Teng, Maw‐Sheng Chern and Hui‐Ling Yang

Optimality of the greedy shooting strategy in the presence of incomplete damage information pp. 613-622: Gad Manor and Moshe Kress
Testing or fault‐finding for reliability growth: A missile destructive‐test example pp. 623-637: D.P. Gaver and P.A. Jacobs
Optimal nonmyopic gambling strategy for the generalized Kelly criterion pp. 639-654: S. Cetinkaya and M. Parlar
A nonparametric Bayes approach to decide system burn‐in time pp. 655-671: Wei‐Ting Kary Chien and Way Kuo
Average‐case analysis of the bin‐packing problem with general cost structures pp. 673-686: Julien Bramel, WanSoo T. Rhee and David Simchi‐Levi
An engagement model to optimize defense against a multiple attack assuming perfect kill assessment pp. 687-697: Bao U. Nguyen, Peter A. Smith and Du Nguyen

Acceptance sampling, imperfect production, and the optimality of zero defects pp. 515-530: S. Andrew Starbird
Scheduling stochastic jobs with asymmetric earliness and tardiness penalties pp. 531-557: X. Cai and S. Zhou
Algorithms for computing waiting time distributions under different queue disciplines for the D‐BMAP/PH/1 pp. 559-576: Imed Frigui, Attahiru Sule Alfa and Xiaoyi Xu
Cyclical schedules for the joint replenishment problem with dynamic demands pp. 577-589: Ian R. Webb, Bruce R. Buzby and Gerard M. Campbell
Variable sampling plans for normal distribution indexed by Taguchi's loss function pp. 591-603: Ikuo Arizono, Akihiro Kanagawa, Hiroshi Ohta, Kyouko Watakabe and Kouji Tateishi
Note: Minimizing the variability of the waiting times in a globally gated elevator polling system pp. 605-611: Laurence A. Baxter, Farid Harche and Uri Yechiali

Minimum cost component test plans for evaluating reliability of a highly reliable parallel system pp. 401-418: Jayant Rajgopal and Mainak Mazumdar
Efficient methods for sequencing minimum job sets on mixed model assembly lines pp. 419-437: Ahmet Bolat
Markov decision processes with restricted observations: Finite horizon case pp. 439-456: Yasemin Serin and Zeynep Muge Avsar
Stock‐rationing policy for a make‐to‐stock production system with two priority classes and backordering pp. 457-472: Albert Y. Ha
Meeting seasonal demand for products with limited shelf lives pp. 473-483: Danny C. Myers
Routing in packet‐switched communication networks with different criticality classes of communicating node pairs pp. 485-505: Ali Amiri and Hasan Pirkul
Attrition modeling in the presence of decoys: An operations‐other‐than‐war motivation pp. 507-514: D.P. Gaver and P.A. Jacobs

Optimizing submarine berthing with a persistence incentive pp. 301-318: Gerald G. Brown, Kelly J. Cormican, Siriphong Lawphongpanich and Daniel B. Widdis
Demand shuffle—A method for multilevel proportional lot sizing and scheduling pp. 319-340: A. Kimms
Polynomial algorithms for center location on spheres pp. 341-352: Mordechai Jaeger and Jeff Goldberg
On a ruckle problem in discrete games of ambush pp. 353-364: A.Y. Garnaev
Heuristic scheduling of resource‐constrained projects with cash flows pp. 365-381: Rema Padman, Dwight E. Smith‐Daniels and Vicki L. Smith‐Daniels
A Markovian model for process setup and improvement pp. 383-400: Linguo Gong, James Pruett and Kwei Tang

Multiple‐facility loading under capacity‐based economies of scope pp. 229-256: Joseph B. Mazzola and Robert H. Schantz
Joint determination of preventive maintenance and safety stocks in an unreliable production environment pp. 257-272: Ki Ling Cheung and Warren H. Hausman
A heuristic algorithm for determining replacement policies in k‐out‐of‐n systems pp. 273-286: Chia‐Shin Chung and James Flynn
Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs pp. 287-299: Awi Federgruen and Gur Mosheiov

Analysis of aircraft sortie generation with the use of a fork‐join queueing network model pp. 153-164: Dennis C. Dietz and Richard C. Jenkins
Robustness of the normal approximation of lead‐time demand in a distribution setting pp. 165-186: John E. Tyworth and Liam O'Neill
A dynamic model for component testing pp. 187-197: I. Kuban Altinel and Süleyman Özekici
Warranty policies and burn‐in pp. 199-209: Jie Mi
A generalized Johnson's rule for stochastic assembly systems pp. 211-220: Rhonda Righter
Note: Dynamic lot sizing for a finite rate input process pp. 221-228: Roger M. Hill

Computational study of the multiechelon production planning problem pp. 1-19: Sunil Chopra, M.R. Rao and Chih‐Yang Tsai
Cost‐based due‐date assignment with the use of classical and neural‐network approaches pp. 21-46: Patrick R. Philipoom, Lars Wiegmann and Loren Paul Rees
Towards finding global representations of the efficient set in multiple objective mathematical programming pp. 47-67: Harold P. Benson and Serpil Sayin
Compromise allocation in multivariate stratified sampling: An integer solution pp. 69-79: M. G. M. Khan, M. J. Ahsan and Nujhat Jahan
Replacing continuous demand with discrete demand in a competitive location model pp. 81-95: Tammy Drezner and Zvi Drezner
Minimization of expected variance of completion times on single machine for stochastic jobs pp. 97-108: V. Rajendra Prasad and D. K. Manna
Decomposition and hybrid simulated annealing heuristics for the parallel‐machine total tardiness problem pp. 109-125: Christos Koulamas
Exact bayesian estimation of system reliability from component test data pp. 127-146: Jen Tang, Kwei Tang and Herbert Moskowitz
Note: Optimal allocation of resources to nodes of series systems with respect to failure‐rate ordering pp. 147-152: Harshinder Singh and Radhey S. Singh