Journal: Operations Research Letters

Found 1763 papers in total
An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines
An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines
2003,
In this paper, we introduce a new concept of semi-preemptive scheduling and we show...
How useful are preemptive schedules?
How useful are preemptive schedules?
2003,
Machine scheduling admits two options to process jobs. In a preemptive mode processing...
Local search for multiprocessor scheduling: How many moves does it take to a local optimum?
Local search for multiprocessor scheduling: How many moves does it take to a local optimum?
2003,
We analyze two local search algorithms for multiprocessor scheduling. The first...
Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem
Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem
2003,
We consider the single machine dynamic total completion time scheduling problem. This...
The two-machine open shop problem: To fit or not to fit, that is the question
The two-machine open shop problem: To fit or not to fit, that is the question
2003,
We consider the open shop scheduling problem with two machines. Each job consists of...
The three-machine proportionate flow shop problem with unequal machine speeds
The three-machine proportionate flow shop problem with unequal machine speeds
2003,
In flow shop scheduling it is usually assumed that the processing times of the...
A class of on-line scheduling algorithms to minimize total completion time
A class of on-line scheduling algorithms to minimize total completion time
2003,
We consider the problem of scheduling jobs on-line on a single machine and on...
Foundation-penalty cuts for mixed-integer programs
Foundation-penalty cuts for mixed-integer programs
2003,
We propose a new class of foundation-penalty (FP) cuts for MIPs that are easy to...
Accurate calculation of hazardous materials transport risks
Accurate calculation of hazardous materials transport risks
2003,
We propose two path-selection algorithms for the transport of hazardous materials. The...
The equivalence between processor sharing and service in random order
The equivalence between processor sharing and service in random order
2003,
In this note we explore a useful equivalence relation for the delay distribution in...
Waiting time distribution of the MAP/D/k system in discrete time – a more efficient algorithm
Waiting time distribution of the MAP/D/k system in discrete time – a more efficient algorithm
2003,
We show that the discrete time MAP/D/k presented by Chaudhry et al . has a special...
A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems
A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems
2003,
This paper is concerned with the problem of unconstrained two-dimensional cutting of...
On the characterization of continuum structure functions
On the characterization of continuum structure functions
2003,
A continuum structure function is a non-decreasing mapping from the unit hypercube to...
Reconstructing edge-disjoint paths
Reconstructing edge-disjoint paths
2003,
For an undirected graph G = (V, E), the edge connectivity values between every pair of...
The quickest path problem with batch constraints
The quickest path problem with batch constraints
2003,
The quickest path problem has been proposed to cope with flow problems through...
Approximative procedures for no-wait job shop scheduling
Approximative procedures for no-wait job shop scheduling
2003,
In this article we consider the no-wait job shop problem with makespan objective....
Approximability of two-machine no-wait flowshop scheduling with availability constraints
Approximability of two-machine no-wait flowshop scheduling with availability constraints
2003,
We consider in this paper the two-machine no-wait flowshop scheduling problem in which...
On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times
On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times
2003,
We consider the single machine, serial batching, total completion time scheduling...
Computing an obnoxious anchored segment
Computing an obnoxious anchored segment
2003,
In this paper we address a maximin facility location problem for n points in the plane...
A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis
A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis
2002,
We consider a scheduling problem in which the processors are arranged along a straight...
Improved approximation algorithms for multilevel facility location problems
Improved approximation algorithms for multilevel facility location problems
2002,
We show that the metric multilevel facility location problem is polynomial-time...
Separation of partition inequalities for the (1,2)-survivable network design problem
Separation of partition inequalities for the (1,2)-survivable network design problem
2002,
Given a graph G = (V,E) with edge costs and an integer vector r∈ℤ + V...
Preservation of association in multivariate shock and claim models
Preservation of association in multivariate shock and claim models
2002,
Consider m counting processes Γ i , i=1,2,...,m, and a random vector of positive...
Approximation algorithms for fractional knapsack problems
Approximation algorithms for fractional knapsack problems
2002,
We consider the combinatorial optimization problem where the objective function is the...
Papers per page: