Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Journal: Operations Research Letters
Found
1763 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Properties of the multiple lot-sizing problem with rigid demand, general cost structures, and interrupted geometric yield
1999,
Guu Sy-Ming
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,
Kijima Masaaki
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,
Chen Fangruo
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,
Constantino Miguel
We examine the uncapacitated single-item lotsizing problem with backlogging and...
A comment on consecutive-2-out-of-n systems
2001,
Woeginger Gerhard J.
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 T.S.
Arthanari proposed a Multistage-insertion (MI)-formulation of the symmetric traveling...
An analysis of multiple-class vacation queues with individual thresholds
2001,
Lee Ho Woo
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,
Artalejo J.R.
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,
Mller Jakob R.
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,
Mandjes Michel
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,
Parthasarathy P.R.
For a special state-dependent birth–death discrete time queue in which customers...
The effect of long-memory arrivals on queue performance
2001,
Willemain Thomas R.
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,
Lorenz Dean H.
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,
Mitchell Kenneth
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,
Balakrishnan Anantaram
An intuitive solution-doubling argument establishes well known results concerning the...
Flow pack facets of the single node fixed-charge flow polytope
2001,
Atamtrk Alper
We present a class of facet-defining inequalities for the single node fixed-charge...
Relatively monotone variational inequalities over product sets
2001,
Konnov Igor V.
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,
Sun Defeng
Let H : ℜ m × ℜ n → ℜ n be a locally Lipschitz function in a...
On project scheduling with irregular starting time costs
2001,
Mhring Rolf H.
Maniezzo and Mingozzi study a project scheduling problem with irregular starting time...
Stochastic single machine scheduling with an exponentially distributed due date
2001,
Jia Chunfu
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,
Baptiste Philippe
McNaughton's theorem states that preemptions in scheduling arbitrary processing time...
Semi-on-line scheduling with ordinal data on two uniform machines
2001,
He Yong
We investigate the problem of semi-on-line scheduling of jobs on two uniform machines...
Optimal ordering of operations in a manufacturing chain
2001,
Shanthikumar J. George
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,
Simchi-Levi David
In the single machine mean completion time problem with release dates, a set of jobs...
First Page
39
40
41
42
43
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers