Journal: Operations Research Letters

Found 1763 papers in total
On the credibility of the conditional risk model for routing hazardous materials
On the credibility of the conditional risk model for routing hazardous materials
1995,
The paper suggests that a recently proposed model for finding hazardous materials...
Solving hard set covering problems
Solving hard set covering problems
1995,
The authors propose a new branch-and-bound algorithm to solve hard instances of set...
An upper bound on the independence number of a graph computable in polynomial-time
An upper bound on the independence number of a graph computable in polynomial-time
1995,
The upper bound on the independence number of a undirected graph is presented. The...
A dual approximation approach to eighted matroid intersection
A dual approximation approach to eighted matroid intersection
1995,
This paper presents a simple algorithm for finding a minimum weight common base of a...
A sublinear-time randomized approximation algorithm for matrix games
A sublinear-time randomized approximation algorithm for matrix games
1995,
This paper presents a parallel randomized algorithm which computes a pair of •-...
Weak stochastic ordering for multidimensional Markov chains
Weak stochastic ordering for multidimensional Markov chains
1995,
This paper studies weak stochastic ordering on multidimensional lattices. The main...
Stochastic scheduling on a single machine subject to multiple breakdowns according to different probabilities
Stochastic scheduling on a single machine subject to multiple breakdowns according to different probabilities
1995,
A set of stochastic jobs is to be processed on a single machine which is subject to...
W[2]-hardness of Precedence Constrained K-Processor Scheduling
W[2]-hardness of Precedence Constrained K-Processor Scheduling
1995,
It is shown that the Precedence Constrained K- Processor Scheduling problem is hard...
An optimal algorithm for preemptive on-line scheduling
An optimal algorithm for preemptive on-line scheduling
1995,
The authors investigate the problem of on-line scheduling jobs on m identical parallel...
Canonical DC programming problem: Quter approximation methods revisited
Canonical DC programming problem: Quter approximation methods revisited
1995,
For solving the canonical DC programming problem (i.e. a convex program with an...
A tight lower bound for optimal bin packing
A tight lower bound for optimal bin packing
1995,
In this paper, the authors present an O( n log n) algorithm to compute a tight lower...
Faces of diameter two on the Hamilton cycle polytope
Faces of diameter two on the Hamilton cycle polytope
1995,
In this paper it is shown that faces of the Hamiltonian cycle polytope (also called...
Analysis of a two-stage finite buffer flow controlled queueing model by a compensation method
Analysis of a two-stage finite buffer flow controlled queueing model by a compensation method
1995,
The exact analysis of a two-stage finite buffer Markovian queueing model with blocking...
A queueing network model with catastrophes and product form solution
A queueing network model with catastrophes and product form solution
1995,
Consider a network of queues with the possibility of catastrophes at each station....
Heavy-traffic extreme-value limits for queues
Heavy-traffic extreme-value limits for queues
1995,
The authors consider the maximum waiting time among the first n customers in the...
Calculating the M/G/1 busy-peiod density and LIFO waiting-time distribution by direct numerical transform inversion
Calculating the M/G/1 busy-peiod density and LIFO waiting-time distribution by direct numerical transform inversion
1995,
It is well known that the M/G/1 busy-period density can be characterized by the...
Improving the complexities of approximation algorithms for optimization problems
Improving the complexities of approximation algorithms for optimization problems
1995,
A procedure to improve the lower and upper bound for the optimal objective function...
A Lagrangian relaxation algorithm for sparse quadratic assignment problems
A Lagrangian relaxation algorithm for sparse quadratic assignment problems
1995,
The Task Assignment Problem (TAP) arises in distributed computing environments and is...
NETPAD: An interactive graphics system for network modeling and optimization
NETPAD: An interactive graphics system for network modeling and optimization
1995,
The practical and theoretical importance of network models and algorithms is clearly...
An O(mn2) algorithm for the Maximin problem in E’2
An O(mn2) algorithm for the Maximin problem in E’2
1995,
An O( mn 2 ) algorithm is developed in this paper for the Euclidean weighted Maximin...
•-Approximation minimization of convex functions in fixed dimension
•-Approximation minimization of convex functions in fixed dimension
1996,
The authors consider the problem of minimizing a convex function v(λ), over a...
Batch scheduling to minimize total completion time
Batch scheduling to minimize total completion time
1994,
The paper addresses single and multiple machine versions of the batch scheduling...
Scheduling shops to minimize the weighted number of late jobs
Scheduling shops to minimize the weighted number of late jobs
1994,
The problem of scheduling jobs with a common due date d so that the weighted number of...
A comment on ‘a simple sequencing algorithm for mixed-model assembly lines in just-in-time production systems’
A comment on ‘a simple sequencing algorithm for mixed-model assembly lines in just-in-time production systems’
1994,
Recently Ding and Chen have published an O( nD) heuristic for the level schedule...
Papers per page: