Journal: Operations Research Letters

Found 1763 papers in total
On decomposition of the total tardiness problem
On decomposition of the total tardiness problem
1995,
As an improvement of the famous Lawler Decomposition Theorme for the one-machine total...
Single machine batch scheduling with deadlines and resource dependent processing times
Single machine batch scheduling with deadlines and resource dependent processing times
1995,
The authors consider the problem of scheduling n jobs on a single machine where each...
An improved bound for the multifacility location model
An improved bound for the multifacility location model
1995,
This paper develops a dual-based lower bound to the multifacility 𝓁 p distance...
The simplex algorithm with a new primal and dual pivot rule
The simplex algorithm with a new primal and dual pivot rule
1994,
The authors present a simplex-type algorithm for linear programming that works with...
Some applications of nonnegative linear systems: Farkas strikes again
Some applications of nonnegative linear systems: Farkas strikes again
1994,
This paper presents a unifying perspective for analyzing certain systems of linear...
A simple variational problem for a moving vehicle
A simple variational problem for a moving vehicle
1994,
The problem of determining an optimal path of a moving vehicle, considered in Sherali...
Solvable cases of the k-person Chinese postman problem
Solvable cases of the k-person Chinese postman problem
1994,
Given a network, the well-known Chinese Postman Problem (CPP) is to find a shortest...
Choosing sample path length and number of sample paths when starting in steady state
Choosing sample path length and number of sample paths when starting in steady state
1994,
Consider the problem of estimating the mean of a strictly stationary stochastic...
Three, four, five, six, or the complexity of scheduling with communication delays
Three, four, five, six, or the complexity of scheduling with communication delays
1994,
A set of unit-time tasks has to be processed on identical parallel processors subject...
Minimizing makespan in hybrid flowshops
Minimizing makespan in hybrid flowshops
1994,
The authors consider flowshop environments that consist of multiple stages and...
Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs
Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs
1994,
This paper addresses a class of single-machine scheduling problems with a common...
Approximating minimum-cost graph problems with spanning tree edges
Approximating minimum-cost graph problems with spanning tree edges
1994,
Building on work of Imielinska, Kalantari and Khachiyan, the authors show how to find...
The expected relative error of the polyhedral approximation of the max-cut problem
The expected relative error of the polyhedral approximation of the max-cut problem
1994,
The authors study the expected relative error of a linear relaxation of the max-cut...
New lower and upper bounds for on-line scheduling
New lower and upper bounds for on-line scheduling
1994,
The authors investigate the problem of on-line scheduling a set of independent jobs on...
New characterizations of solutions to overdetermined systems of linear equations
New characterizations of solutions to overdetermined systems of linear equations
1994,
New characterizations of the solutions to overdetermined systems of linear equations...
A note on Jackson networks with state-dependent rejection probabilities
A note on Jackson networks with state-dependent rejection probabilities
1994,
In general capacity constraints prohibit a product form limiting distribution for a...
On the EOQ model with inventory-level-dependent demand rate and random yield
On the EOQ model with inventory-level-dependent demand rate and random yield
1994,
This paper deals with an EOQ-type inventory problem where the demand rate is a...
Finding maximum matching for bipartite graphs in parallel
Finding maximum matching for bipartite graphs in parallel
1994,
This paper shows that the maximum matching problem on bipartite graphs can be solved...
Reliability analysis of a simple replicated and-fork/and-join graph
Reliability analysis of a simple replicated and-fork/and-join graph
1994,
In this paper, the authors consider the problem of calculating the reliability of the...
A note on single-processor scheduling with time-dependent execution times
A note on single-processor scheduling with time-dependent execution times
1995,
The paper considers a single-processor scheduling model where the execution time of a...
An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date
An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date
1995,
In 1991, Hall et al showed that the problem of minimizing the mean earliness and...
Minimization of SC1 functions and the Maratos effect
Minimization of SC1 functions and the Maratos effect
1995,
The paper considers the unconstrained minimization of a continuously differentiable...
An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane
An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane
1994,
The minimum norm point problem is to find the minimum norm point in the convex hull of...
A descent proximal level bundle method for convex nondifferentiable optimization
A descent proximal level bundle method for convex nondifferentiable optimization
1995,
The authors give a proximal level method for convex minimization that uses projections...
Papers per page: