Journal: Naval Research Logistics

Found 1212 papers in total
An analysis of six greedy selection rules on a class of zero-one integer programming models
An analysis of six greedy selection rules on a class of zero-one integer programming models
1990,
Six greedy primal selection rules are evaluated on a class of generalized set packing...
A relaxation/decomposition algorithm for the fixed charged network problem
A relaxation/decomposition algorithm for the fixed charged network problem
1990,
This article makes use of relaxation in conjunction with decomposition for the...
An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming
An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming
1990,
Although there has been extensive research on interactive multiple objective decision...
Deterministic methods in constrained global optimization: Some recent advances and new fields of application
Deterministic methods in constrained global optimization: Some recent advances and new fields of application
1990,
Recent developments in deterministic global optimization methods have considerably...
An algorithm for concave integer minimization over a polyhedron
An algorithm for concave integer minimization over a polyhedron
1990,
The authors present an algorithm for solving the problem of globally minimizing a...
An algorithm for quadratic zero-one programs
An algorithm for quadratic zero-one programs
1990,
The authors present an algorithm for the quadratic zero-one minimization by...
A simulated annealing approach to scheduling a manufacturing cell
A simulated annealing approach to scheduling a manufacturing cell
1990,
This article proposes a new heuristic based on simulated annealing that schedules part...
A Bard-type method for a generalized linear complementarity problem with a nonsingular M-matrix
A Bard-type method for a generalized linear complementarity problem with a nonsingular M-matrix
1990,
In this article the authors develop an extension of Murty’s Bard-type method for...
Formulating processing network models: Viability theory
Formulating processing network models: Viability theory
1990,
A processing network contains at least one processing node; such a node is constrained...
An interactive MCDM weight space reduction method utilizing a Tchebycheff utility function
An interactive MCDM weight space reduction method utilizing a Tchebycheff utility function
1990,
Employing a Tchebycheff utility function to locally approximate the underlying utility...
Guaranteed •-approximate solution for indefinite quadratic global minimization
Guaranteed •-approximate solution for indefinite quadratic global minimization
1990,
The global minimization of large-scale indefinite quadratic problems over a bounded...
An assignment problem with queueing time cost
An assignment problem with queueing time cost
1990,
In this article the authors study the problem of assigning customers to service...
Multiple finite source queueing model with dynamic priority scheduling
Multiple finite source queueing model with dynamic priority scheduling
1990,
This article involves the study of a multiple finite source queueing model with a...
A correspondence principle for relative entropy minimization
A correspondence principle for relative entropy minimization
1990,
Relative entropy minimization has been proposed as an inference method for problems...
Optimal file allocation and report assignment in distributed information
Optimal file allocation and report assignment in distributed information
1990,
Distributed database systems is a current design practice in database architecture....
Control of input and demand rates in inventory systems of perishable commodities
Control of input and demand rates in inventory systems of perishable commodities
1990,
In this article the authors explore some problems of control of arrival and demand...
Scheduling tasks with failure probabilities to minimize expected cost
Scheduling tasks with failure probabilities to minimize expected cost
1990,
A project is made of several tasks which can be executed in parallel. Each task is...
Priority repair and dispatch policies for repairable-item logistics systems
Priority repair and dispatch policies for repairable-item logistics systems
1990,
This article presents the results of a simulation study concerned with repairable...
Solving resource-constrained project scheduling problems by A* search
Solving resource-constrained project scheduling problems by A* search
1990,
A new exact method is presented for finding a minimum makespan schedule for a...
Worst-case analysis of local search heuristics for the one-machine total tardiness problem
Worst-case analysis of local search heuristics for the one-machine total tardiness problem
1990,
In this article the worst-case performance of four local search heuristics for the...
Lanchester attrition of interpenetrating forces
Lanchester attrition of interpenetrating forces
1990,
To approximate the solutions of detailed simulations of interpenetrating forces (or...
Level crossing analysis of priority queues and a conservation identity for vacation models
Level crossing analysis of priority queues and a conservation identity for vacation models
1989,
The two purposes of this article are to illustrate the power and simplicity of level...
Monte Carlo estimation of the maximal flow distribution with discrete stochastic arc capacity levels
Monte Carlo estimation of the maximal flow distribution with discrete stochastic arc capacity levels
1989,
This article describes a highly efficient Monte Carlo sampling plan for estimating...
Estimating a survival curve when new is better than used in expectation
Estimating a survival curve when new is better than used in expectation
1989,
Let X be a positive random variable. The distribution F of X is said to be ‘new...
Papers per page: