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
Linear programming with variable matrix entries
2005,
Serafini Paolo
We consider linear programming (continuous or integer) where some matrix entries are...
Stochastic mathematical programs with equilibrium constraints
1999,
Patriksson Michael
We introduce stochastic mathematical programs with equilibrium constraints (SMPEC),...
Existence of a solution to nonlinear variational inequality under generalized positive homogeneity
1999,
Zhao Yunbin
We establish several new existence theorems for nonlinear variational inequalities...
On the convergence of the block linear Gauss–Seidel method under convex constraints
2000,
Grippo L.
We give new convergence results for the block Gauss–Seidel method for problems...
On stages and consistency checks in stochastic programming
2005,
Prkopa Andrs
This paper gives a rigorous definition of a stage, usable for dynamic stochastic...
On some parallels between the loss probability in the GI/G/1 loss system and the delay probability in the GI/G/1 queue
1999,
Atkinson J. Ben
In this paper, it is shown that the stationary probability of loss decreases when the...
Optimal admission to reader–writer systems with no queueing
1999,
Kulkarni Vidyadhar G.
We consider a reader–writer system with no queueing. An unlimited number of...
On the finite-buffer bulk-service queue with general independent arrivals: GI/M[b]/1/N
1999,
Gupta U.C.
We consider a single server finite-buffer bulk-service queue in which the interarrival...
On the waiting time in queues with dependency between interarrival and service times
2000,
Mller Alfred
In this paper a queueing system with partial correlation is considered. We assume that...
A correlated M/G/1-type queue with randomized server repair and maintenance modes
2000,
Posner M.J.M.
We consider a single machine, subject to breakdown, that produces items to inventory,...
Some well-behaved estimators for the M/M/1 queue
2000,
Seila Andrew F.
It is known, given the observed traffic intensity ρˆ < 1, the expected...
Analysis of a GI/M/1 queue with multiple working vacations
2005,
Baba Yutaka
Consider a GI/M/1 queue with vacations such that the server works with different rates...
Efficient data allocation for frequency domain experiments
2000,
Sanchez Susan M.
Frequency domain experiments are efficient screening procedures for identifying...
Asymptotics for renewal-reward processes with retrospective reward structure
2000,
Csenki Attila
Let {(X i ,Y i ): i=…,-1,0,1,…} be a doubly infinite...
Optimal control of a simple manufacturing system with restarting costs
2000,
Salama Y.
We consider the optimal control of an unreliable manufacturing system with restarting...
Worst-case analysis of the greedy algorithm for a generalization of the maximum p-facility location problem
2000,
Sviridenko M.I.
In this work we consider the maximum p-facility location problem with k additional...
The project scheduling problem with irregular starting time costs
1999,
Mingozzi Aristide
We consider the problem of scheduling a set of activities satisfying precedence...
A polynomial-time algorithm to find an equitable home–away assignment
2005,
Matsui Tomomi
We propose a polynomial-time algorithm to find an equitable home–away assignment...
A polynomial-time algorithm for the change-making problem
2005,
Pearson David
Optimally making change – representing a given value with the fewest coins from...
A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine
1999,
Hochbaum Dorit S.
We present a new linear programming relaxation for the problem of minimizing the sum...
A lower bound for on-line scheduling on uniformly related machines
2000,
Epstein Leah
We consider the problem of on-line scheduling of jobs arriving one by one on uniformly...
A comment on scheduling on uniform machines under chain-type precedence constraints
2000,
Woeginger Gerhard J.
In a recent paper, Chekuri and Bender derive (among other results) a polynomial-time...
A 1.47-approximation algorithm for a preemptive single-machine scheduling problem
2000,
Goemans Michel X.
In this note, we give a 1.47-approximation algorithm for the preemtpive scheduling of...
A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups
2000,
Potts Chris N.
We consider a problem of scheduling jobs in two-machine no-wait flow shops for which...
First Page
27
28
29
30
31
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers