Journal: Operations Research Letters

Found 1763 papers in total
Cutting planes from a mixed integer Farkas lemma
Cutting planes from a mixed integer Farkas lemma
2004,
We present a mixed integer version of the lattice analogue of the Farkas lemma. It...
An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time
An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time
2003,
We consider a scheduling problem in which n jobs with distinct deadlines are to be...
When greediness fails: examples from stochastic scheduling
When greediness fails: examples from stochastic scheduling
2003,
The purpose of this paper is to present examples for the sometimes surprisingly...
An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
2004,
Based on the work by Congram, Potts and Van de Velde, we develop for the...
Financial transmission rights in convex pool markets
Financial transmission rights in convex pool markets
2004,
This paper studies financial transmission rights in electricity pool markets with...
Managing multi-customer service level requirements with a simple rationing policy
Managing multi-customer service level requirements with a simple rationing policy
2003,
We consider the problem of managing multi-customer service level requirements when...
On the two-dimensional Knapsack problem
On the two-dimensional Knapsack problem
2004,
We address the two-dimensional Knapsack Problem (2KP), aimed at packing a...
Estimation for nonhomogeneous Poisson processes from aggregated data
Estimation for nonhomogeneous Poisson processes from aggregated data
2003,
A well-known heuristic for estimating the rate function or cumulative rate function of...
The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands
The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands
2003,
By showing that there is an upper bound for the price of anarchy ρ(Γ) for a...
Node packings on cocomparability graphs
Node packings on cocomparability graphs
2003,
We give a compact formulation for the clique inequalities defining the fractional node...
Delay performance in stochastic processing networks with priority service
Delay performance in stochastic processing networks with priority service
2003,
We evaluate the delay performance of an open multi-class stochastic processing network...
Complete description of a class of knapsack polytopes
Complete description of a class of knapsack polytopes
2003,
We study the knapsack polytopes that arise whenever the item weights are of two types:...
The weighted consecutive ones problem for a fixed number of rows or columns
The weighted consecutive ones problem for a fixed number of rows or columns
2003,
The NP-hard weighted consecutive ones problem consists of converting a given...
Transformations of generalized asymmetric traveling salesman problems into simple asymmetric traveling salesman problems
Transformations of generalized asymmetric traveling salesman problems into simple asymmetric traveling salesman problems
2003,
The generalized traveling salesman problem (GTSP) is stated as follows. Given a...
A tandem queueing model with coupled processors
A tandem queueing model with coupled processors
2003,
We consider a tandem queue with coupled processors and analyze the two-dimensional...
Analysis of the M/G/1 processor-sharing queue with bulk arrivals
Analysis of the M/G/1 processor-sharing queue with bulk arrivals
2003,
We analyze the single server processor-sharing queue for the case of bulk arrivals. We...
Sojourn time distribution in a MAP/M/1 processor-sharing queue
Sojourn time distribution in a MAP/M/1 processor-sharing queue
2003,
This paper considers the sojourn time distribution in a processor-sharing queue with a...
Minimizing flow time in cyclic schedules for identical jobs with acyclic precedence: The bottleneck lower bound
Minimizing flow time in cyclic schedules for identical jobs with acyclic precedence: The bottleneck lower bound
2003,
This paper studies minimizing the flow time of a cyclic schedule for repeated...
Minimizing breaks by maximizing cuts
Minimizing breaks by maximizing cuts
2003,
We propose to solve the break minimization problem in sports scheduling by...
On a single item fill rate for a finite horizon
On a single item fill rate for a finite horizon
2003,
We investigate expressions for expected item fill rate in a periodic inventory system....
On the convergence of a modified algorithm for the spherical facility location problem
On the convergence of a modified algorithm for the spherical facility location problem
2003,
We study the spherical facility location problem which is a more realistic model than...
Renewal analysis of a replacement process
Renewal analysis of a replacement process
2003,
We consider a unit with a random lifetime which is replaced at renewal times by a new...
A paradox in equipment replacement under technological improvement
A paradox in equipment replacement under technological improvement
2003,
It is commonly assumed that an acceleration in technological improvement should result...
Explicit results for wear processes in a Markovian environment
Explicit results for wear processes in a Markovian environment
2003,
We consider the reliability of a single-unit system whose cumulative damage over time...
Papers per page: