Journal: Operations Research Letters

Found 1763 papers in total
On complexity of multistage stochastic programs
On complexity of multistage stochastic programs
2006,
In this paper we derive estimates of the sample sizes required to solve a multistage...
Locating two obnoxious facilities using the weighted maximin criterion
Locating two obnoxious facilities using the weighted maximin criterion
2006,
Given are a finite set of points P and a compact polygonal set S in R 2 . The problem...
Explicit solutions to European options in a regime-switching economy
Explicit solutions to European options in a regime-switching economy
2005,
We provide closed-form solutions for European option values when the dynamics of both...
A short proof of the NP-completeness of minimum sum interval coloring
A short proof of the NP-completeness of minimum sum interval coloring
2005,
In the minimum sum coloring problem we have to assign positive integers to the...
Complexity of the min–max and min–max regret assignment problems
Complexity of the min–max and min–max regret assignment problems
2005,
This paper investigates the complexity of the min–max and min–max regret...
On the fractional chromatic index of a graph and its complement
On the fractional chromatic index of a graph and its complement
2005,
Jenson and Toft conjectured that for a graph with an even number of vertices, either...
A fast algorithm for minimum weight odd circuits and cuts in planar graphs
A fast algorithm for minimum weight odd circuits and cuts in planar graphs
2005,
We give a simple O( n 3/2 log n ) algorithm for finding a minimum weight odd circuit...
Another greedy heuristic for the constrained forest problem
Another greedy heuristic for the constrained forest problem
2005,
The constrained forest problem seeks a minimum-weight spanning forest in an undirected...
Two-connected Steiner networks: structural properties
Two-connected Steiner networks: structural properties
2005,
We give a number of structural results for the problem of constructing a...
Random waypoint model in n-dimensional space
Random waypoint model in n-dimensional space
2005,
The random waypoint model (RWP) is one of the most widely used mobility models in...
A practical inventory control policy using operational statistics
A practical inventory control policy using operational statistics
2005,
Consider the newsvendor inventory control problem with an ambiguous demand. The...
On-line scheduling to minimize maximum flow time: an optimal preemptive algorithm
On-line scheduling to minimize maximum flow time: an optimal preemptive algorithm
2005,
We investigate the maximum flow time minimization problem of on-line scheduling jobs...
Characterizations of polygreedoids and poly-antimatroids by greedy algorithms
Characterizations of polygreedoids and poly-antimatroids by greedy algorithms
2005,
A polygreedoid and a poly-antimatroid are the generalization of a greedoid and an...
A labeling method for dynamic driver-task assignment with uncertain task durations
A labeling method for dynamic driver-task assignment with uncertain task durations
2005,
The problem of assigning drivers to cover tasks with service time windows and...
Robust profit opportunities in risky financial portfolios
Robust profit opportunities in risky financial portfolios
2005,
For risky financial securities with given expected return vector and covariance...
On the exponential cardinality of FDS for the ordered p-median problem
On the exponential cardinality of FDS for the ordered p-median problem
2005,
We study finite dominating sets (FDS) for the ordered median problem. This kind of...
Contingency management under asymmetric information
Contingency management under asymmetric information
2005,
We model a monopolist supplier whose supply to multiple buyers is disrupted. The...
Asymptotically optimal schedules for single-server flow shop problems with setup costs and times
Asymptotically optimal schedules for single-server flow shop problems with setup costs and times
2005,
We consider the processing of M jobs in a flow shop with N stations in which only a...
Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
2005,
In this paper, the single machine sequencing problem with maximum lateness criterion...
On the complexity of scheduling unit-time jobs with OR-precedence constraints
On the complexity of scheduling unit-time jobs with OR-precedence constraints
2005,
We present various complexity results for scheduling unit-time jobs subject to...
The no-wait flow-shop paradox
The no-wait flow-shop paradox
2005,
We discuss a new resource paradox in the area of scheduling: Increasing the speed of...
No-wait flexible flowshop scheduling with no-idle machines
No-wait flexible flowshop scheduling with no-idle machines
2005,
This paper considers a two-stage flexible flowshop scheduling problem with no waiting...
A new algorithm and a new heuristic for serial supply systems
A new algorithm and a new heuristic for serial supply systems
2005,
We present a new dynamic programming formulation for the stochastic multi-stage serial...
Improved dynamic programs for some batching problems involving the maximum lateness criterion
Improved dynamic programs for some batching problems involving the maximum lateness criterion
2000,
We study four scheduling problems involving the maximum lateness criterion and an...
Papers per page: