Journal: Naval Research Logistics

Found 1212 papers in total
Computational analysis of MMAP[K]/PH[>K]/ 1 queues with a mixed FCFS and LCFS service discipline
2000,
This paper studies a queueing system with a Markov arrival process with marked...
Workload distribution of discrete-time parallel queues with two servers
2000,
We study discrete-time, parallel queues with two identical servers. Customers arrive...
Estimating distribution functions from partially observed samples
2000,
Suppose that some components are initially operated in a certain condition and then...
Multivariate meta analysis with potentially correlated marketing study results
2000,
A univariate meta analysis is often used to summarize various study results on the...
A O(nm log(U/n)) time maximum flow algorithm
2000,
In this paper, we present an O ( nm log( U/n )) time maximum flow algorithm. If U...
Optimal assignment of high multiplicity flight plans to dispatchers
2000,
This paper addresses the problem of finding a feasible schedule of n jobs on m...
A computationally efficient approach for determining inventory levels in a capacitated multiechelon production–distribution system
2000,
The system under study is a single item, two-echelon production–inventory system...
Bayesian inference for a Lanchester type combat model
2000,
We undertake inference for a stochastic form of the Lanchester combat model. In...
Effectiveness of (R, Q) policies in one-warehouse multiretailer systems with deterministic demand and backlogging
2000,
Consider a distribution system with a central warehouse and multiple retailers....
Applying a bootstrap approach for setting reorder points in military supply systems
2000,
This paper develops and applies a nonparametric bootstrap methodology for setting...
Note on ‘An optimal recursive method for various inventory replenishment models with increasing demand and shortages’ by Teng et al
2000,
In a recent paper, Teng, Chern, and Yang consider four possible inventory...
Bicriteria Euclidean location associated with maximin and minimax criteria
2000,
We are concerned with a single facility bicriteria location model associated with...
Explicit solution of partitioning problems over a 1-dimensional parameter space
2000,
We consider a class of partitioning problems where the partitioned set is a finite set...
Linear compound algorithms for the partitioning problem
2000,
For a given set S of nonnegative integers the partitioning problem asks for a...
Remarks on theory of the core
2000,
This note proposes a necessary and sufficient condition for the existence of an...
A comparative study of three tool replacement/operation sequencing strategies in a flexible manufacturing system
2000,
This paper studies three tool replacement/operation sequencing strategies for a...
Computing bounds on project duration distributions for stochastic PERT networks
2000,
We consider the PERT model with activities whose durations are random variables with...
Selecting T for a periodic review inventory model with staggered deliveries
2000,
Consider a single-item, periodic review, infinite-horizon, undiscounted, inventory...
Lagrangian solution of maximum dispersion problems
2000,
We address the so-called maximum dispersion problems where the objective is to...
Discrete equal-capacity p-median problem
2000,
This paper examines the discrete equal-capacity p -median problem that seeks to locate...
Optimal (τ,T) opportunistic maintenance of a k-out-of-n:G system with imperfect preventive maintenance and partial failure
2000,
The opportunistic maintenance of a k -out-of- n :G system with imperfect preventive...
On the busy period of the M/G/1 retrial queue
2000,
The M/G/ 1 queue with repeated attempts is considered. A customer who finds the server...
Optimal policies for M/M/m queue with two different kinds of (N,T)-policies
2000,
In this paper, two different kinds of ( N , T )-policies for an M/M/m queueing system...
Heuristics for the location of inspection stations on a network
2000,
This article considers the preventive flow interception problem (FIP) on a network....
Papers per page: