Journal: Operations Research Letters

Found 1763 papers in total
Finding minimum area simple pentagons
Finding minimum area simple pentagons
1997,
Given a set P of n points in the plane, we want to find a simple, not necessarily...
Approximation algorithms for the multiprocessor open shop scheduling problem
Approximation algorithms for the multiprocessor open shop scheduling problem
1999,
We investigate the multiprocessor multi-stage open-shop scheduling problem. In this...
An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
1999,
We study the problem of minimizing, the preemptive case, the number of late jobs on a...
Part sequencing in three-machine no-wait robotic cells
Part sequencing in three-machine no-wait robotic cells
2000,
A no-wait robotic cell is an automated flowshop in which a robot is used to move the...
On-line scheduling on a single machine: Maximizing the number of early jobs
On-line scheduling on a single machine: Maximizing the number of early jobs
2000,
This note deals with the scheduling problem of maximizing the number of early jobs on...
Semi-online scheduling with decreasing job sizes
Semi-online scheduling with decreasing job sizes
2000,
We investigate the problem of semi-online scheduling jobs on m identical parallel...
A queueing model in which arrival times are scheduled
A queueing model in which arrival times are scheduled
1997,
In this paper we study a queueing model in which the arrival times of customers are...
An optimal replenishment policy for deteriorating items with time-varying demand and partial – exponential type – backlogging
An optimal replenishment policy for deteriorating items with time-varying demand and partial – exponential type – backlogging
2000,
We study a continuous review inventory model over a finite-planning horizon with...
A multi-stage methodology for the solution of orientated data envelopment analysis models
A multi-stage methodology for the solution of orientated data envelopment analysis models
1998,
The majority of DEA studies use a two-stage linear programming (LP) process to solve...
Solving box constrained variational inequalities by using the natural residual with D-gap function globalization
Solving box constrained variational inequalities by using the natural residual with D-gap function globalization
1998,
We present a new method for the solution of the box constrained variational inequality...
A long-step primal–dual path-following method for semidefinite programming
A long-step primal–dual path-following method for semidefinite programming
1998,
In this paper, the long-step primal–dual path-following method of Jansen et al ....
A two-phase algorithm for solving a class of hard satisfiability problems
A two-phase algorithm for solving a class of hard satisfiability problems
1998,
The DIMACS suite of satisfiability benchmarks contains a set of instances that are...
The partial constraint satisfaction problem: Facets and lifting theorems
The partial constraint satisfaction problem: Facets and lifting theorems
1998,
We study the polyhedral structure of the partial constraint satisfaction problem...
Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities
Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities
1998,
Variational inequalities have important applications in mathematical programming. The...
A note on composite concave quadratic programming
A note on composite concave quadratic programming
1998,
In this paper we present a pivotal-based algorithm for the global minimization of...
Diffusion approximations for Kumar–Seidman network under a priority service discipline
Diffusion approximations for Kumar–Seidman network under a priority service discipline
1998,
Unlike for a single-class queueing network, diffusion approximations for a multiclass...
A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays
A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays
1998,
We investigate a single-machine scheduling problem with precedence delays that have a...
A three-class variance swapping technique for simulation experiments
A three-class variance swapping technique for simulation experiments
1998,
The 2 k factorial design is widely used in simulation experiments involving several...
Minimizing variation in stochastic flow shop
Minimizing variation in stochastic flow shop
1998,
We consider a two-machine flow shop with blocking, and n jobs with random processing...
Batch variance estimators for the median of simulation output
Batch variance estimators for the median of simulation output
1998,
Batching is a well-known technique for estimating the variance of point estimators...
Preemptive on-line scheduling for two uniform processors
Preemptive on-line scheduling for two uniform processors
1998,
This paper considers the problem of preemptive on-line scheduling for two uniform...
Lot streaming in open shops
Lot streaming in open shops
1998,
We study lot streaming in shops in which the order the jobs are to be processed is...
Lexicographic bottleneck combinatorial problems
Lexicographic bottleneck combinatorial problems
1998,
We study combinatorial problems (CP) with lex-bottleneck objective function, where in...
A new matrix bandwidth reduction algorithm
A new matrix bandwidth reduction algorithm
1998,
The problem that we address is, given a matrix, permute rows and columns so that the...
Papers per page: