Journal: Operations Research Letters

Found 1763 papers in total
Properties of the multiple lot-sizing problem with rigid demand, general cost structures, and interrupted geometric yield
1999,
In the study of multiple lot-sizing problem with rigid demand, the cost structure and...
A (T,S) inventory/production system with limited production capacity and uncertain demands
1999,
We consider a single-item, single-location, ( T,S ) inventory/production model with...
Worst-case analysis of (R,Q) policies in a two-stage serial inventory system with deterministic demand and backlogging
1999,
The paper considers a two-stage inventory system where customer demand arises at stage...
Lotsizing with backlogging and start-ups: The case of Wagner–Whitin costs
1999,
We examine the uncapacitated single-item lotsizing problem with backlogging and...
A comment on consecutive-2-out-of-n systems
2001,
In 1986, Du and Hwang proved that the probability of failure in a cyclic double-loop...
On the equivalence of the multistage-insertion and cycle-shrink formulations of the symmetric traveling salesman problem
2001,
Arthanari proposed a Multistage-insertion (MI)-formulation of the symmetric traveling...
An analysis of multiple-class vacation queues with individual thresholds
2001,
This study examines a multiple-class M/G/1 queue with multiple thresholds. Each class...
Stationary analysis of a retrial queue with preemptive repeated attempts
2001,
We consider a retrial queueing system where customers at the retrial group have...
Tail asymptotics for M/G/1-type queueing processes with light-tailed increments
2001,
The exponential tail decay of the steady-state vector is considered for M/G/1-type...
A note on queues with M/G/∞ input
2001,
We consider a fluid queue fed by sessions, arriving according to a Poisson process; a...
Exact transient solution of a state-dependent queue in discrete time
2001,
For a special state-dependent birth–death discrete time queue in which customers...
The effect of long-memory arrivals on queue performance
2001,
Long memory in the sequence of interarrival times is known to have a large impact on...
A simple efficient approximation scheme for the restricted shortest path problem
2001,
In this paper we give a very simple fully polynomial approximation scheme for the...
Constructing a correlated sequence of matrix exponentials with invariant first-order properties
2001,
In this paper, we demonstrate a method for developing analytic Markovian traffic...
Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems
2001,
An intuitive solution-doubling argument establishes well known results concerning the...
Flow pack facets of the single node fixed-charge flow polytope
2001,
We present a class of facet-defining inequalities for the single node fixed-charge...
Relatively monotone variational inequalities over product sets
2001,
New concepts of monotonicity which extend the usual ones are introduced for...
A further result on an implicit function theorem for locally Lipschitz functions
2001,
Let H : ℜ m × ℜ n → ℜ n be a locally Lipschitz function in a...
On project scheduling with irregular starting time costs
2001,
Maniezzo and Mingozzi study a project scheduling problem with irregular starting time...
Stochastic single machine scheduling with an exponentially distributed due date
2001,
In this paper, we consider a single machine scheduling problem with random processing...
On preemption redundancy in scheduling unit processing time jobs on two parallel machines
2001,
McNaughton's theorem states that preemptions in scheduling arbitrary processing time...
Semi-on-line scheduling with ordinal data on two uniform machines
2001,
We investigate the problem of semi-on-line scheduling of jobs on two uniform machines...
Optimal ordering of operations in a manufacturing chain
2001,
We consider the effect of changes in the order of operations in a chain of...
Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates
2001,
In the single machine mean completion time problem with release dates, a set of jobs...
Papers per page: