Journal: Operations Research Letters

Found 1763 papers in total
An optimal algorithm for rectangle placement
An optimal algorithm for rectangle placement
1999,
In this paper we consider the problem of placing efficiently a rectangle in a...
Deterministic lot-size inventory models with shortages and deterioration for fluctuating demand
Deterministic lot-size inventory models with shortages and deterioration for fluctuating demand
1999,
We establish various inventory replenishment policies. We then analytically identify...
Structured p-facility location problems on the line solvable in polynomial time
Structured p-facility location problems on the line solvable in polynomial time
1997,
In this paper we give an O ( pn 2 ) algorithm for solving the p -facility location...
A polynomial time algorithm for a hemispherical minimax location problem
A polynomial time algorithm for a hemispherical minimax location problem
1999,
A polynomial time algorithm to obtain an exact solution for the equiweighted minimax...
How to improve the performance of asynchronous transfer mode multiplexers
How to improve the performance of asynchronous transfer mode multiplexers
1999,
We consider an ATM multiplexer with a finite or infinite buffer and stochastic output...
Bounds on optimal values in stochastic scheduling
Bounds on optimal values in stochastic scheduling
1997,
Consistent stochastic orders of processing times and objective functions yield optimal...
On the existence of schedules that are near-optimal for both makespan and total weighted completion time
On the existence of schedules that are near-optimal for both makespan and total weighted completion time
1997,
We give a simple proof that, for any instance of a very general class of scheduling...
Approximation methods for discrete lot streaming in flow shops
Approximation methods for discrete lot streaming in flow shops
1997,
Lot streaming is the process of splitting a job or lot to allow overlapping between...
Approximation algorithms for maximum dispersion
Approximation algorithms for maximum dispersion
1997,
We describe approximation algorithms with bounded performance guarantees for the...
Markov chain approximation methods in a class of level-crossing problems
Markov chain approximation methods in a class of level-crossing problems
1997,
Level-crossing problems are encountered in a number of stochastic processes such as...
The parsimonious property of cut covering problems and its applications
The parsimonious property of cut covering problems and its applications
1997,
We consider the analysis of linear programming relaxations of a large class of...
Deriving potential functions via a symmetry principle for nonlinear equations
Deriving potential functions via a symmetry principle for nonlinear equations
1997,
Parameterized homotopy equations that define paths through the interior of the...
Potential reduction algorithms for structured combinatorial optimization problems
Potential reduction algorithms for structured combinatorial optimization problems
1997,
Recently Karmarkar proposed a potential reduction algorithm for binary feasibility...
A short proof of optimality of the Bottom Up algorithm for discrete resource allocation problems
A short proof of optimality of the Bottom Up algorithm for discrete resource allocation problems
1997,
The paper deals with the problem of maximizing a separable concave function over...
An open shop scheduling problem with a non-bottleneck machine
An open shop scheduling problem with a non-bottleneck machine
1997,
This paper considers the problem of processing n jobs in a two-machine non-preemptive...
Polynomial algorithms for single machine scheduling problems with financial constraints
Polynomial algorithms for single machine scheduling problems with financial constraints
1997,
This paper deals with the single machine scheduling problem with multiple financial...
Heuristic algorithms for the two-stage hybrid flowshop problem
Heuristic algorithms for the two-stage hybrid flowshop problem
1997,
A two-stage Hybrid Flowshop Problem (FS m 1 , m 2 ) is a two-center shop with several...
Single machine scheduling with discretely controllable processing times
Single machine scheduling with discretely controllable processing times
1997,
In the field of machine scheduling problems with controllable processing times, it is...
Batch scheduling to minimize maximum lateness
Batch scheduling to minimize maximum lateness
1997,
We address the single-machine batch scheduling problem which arises when there are job...
Necessary conditions for global stability of multiclass queueing networks
Necessary conditions for global stability of multiclass queueing networks
1997,
In this paper, we obtain necessary conditions for the global stability of a d -station...
A note on an M/GI/1/N queue with vacation time and exhaustic service discipline
A note on an M/GI/1/N queue with vacation time and exhaustic service discipline
1997,
We consider an M/GI/1/N queue with vacation time and exhaustive service discipline,...
The loss probability in an overloaded queue using the dual queue
The loss probability in an overloaded queue using the dual queue
1997,
In this paper we will consider the single-server finite-capacity queue with a system...
The growth of multi-constraint random knapsacks with large right-hand sides of the constraints
The growth of multi-constraint random knapsacks with large right-hand sides of the constraints
1997,
The asymptotic value of an m -constraint, n -variable, binary random knapsack is...
On dominated terms in the general knapsack problem
On dominated terms in the general knapsack problem
1997,
A necessary and sufficient condition for the identification of dominated terms in a...
Papers per page: