Journal: Operations Research

Found 2096 papers in total
Rendezvous search on the line with limited resources: Maximizing the probability of meeting
Rendezvous search on the line with limited resources: Maximizing the probability of meeting
1999,
Two players are placed on a line at a distance d which is drawn from a known...
Rendezvous search on the line
Rendezvous search on the line
1999,
We present two new results for the asymmetric rendezvous problem on the line. We first...
Dynamic vehicle dispatching: Optimal heavy traffic performance and practical insights
Dynamic vehicle dispatching: Optimal heavy traffic performance and practical insights
1999,
We analyze a general model of dynamic vehicle dispatching systems in which congestion...
Asymptotic mean and variance of electric power generation system production costs via recursive computation of the fundamental matrix of a Markov chain
Asymptotic mean and variance of electric power generation system production costs via recursive computation of the fundamental matrix of a Markov chain
1999,
The cost of producing electricity during a given time interval is a random variable...
Analysis of a sampling control scheme for a perishable inventory system
Analysis of a sampling control scheme for a perishable inventory system
1999,
We consider an inventory system in which both the arrival of items and the demand for...
A set partitioning approach to the crew scheduling problem
A set partitioning approach to the crew scheduling problem
1999,
The crew scheduling problem (CSP) appears in many mass transport systems (e.g.,...
Fast algorithms for parametric scheduling come from extensions to parametric maximum flow
Fast algorithms for parametric scheduling come from extensions to parametric maximum flow
1999,
Chen develops an attractive variant of the classical problem of preemptively...
Analysis of Lagrangian lower bounds for a graph partitioning problem
Analysis of Lagrangian lower bounds for a graph partitioning problem
1999,
Recently, Ahmadi and Tang demonstrated how various manufacturing problems can be...
The simultaneous planning of production, capacity, and inventory in seasonal demand environments
The simultaneous planning of production, capacity, and inventory in seasonal demand environments
1999,
Manufacturing managers often address capacity and inventory decisions separately, thus...
Scheduling in robotic cells: Heuristics and cell design
Scheduling in robotic cells: Heuristics and cell design
1999,
This paper considers scheduling problems arising in robot-served manufacturing cells...
Parallel machine scheduling by column generation
Parallel machine scheduling by column generation
1999,
Parallel machine scheduling problems concern the scheduling of n jobs on m machines to...
Price-directed control of remnant inventory systems
Price-directed control of remnant inventory systems
1999,
Motivated by make-to-order cable manufacturing, we describe a remnant inventory system...
A heuristic method for the set covering problem
A heuristic method for the set covering problem
1999,
We present a Lagrangian-based heuristic for the well-known Set Covering Problem (SCP)....
A facet generation procedure for solving 0–1 integer programs
A facet generation procedure for solving 0–1 integer programs
1999,
This paper presents the Facet Generation Procedure (FGP) for solving 0–1 integer...
Optimal reliability allocation with discrete cost–reliability data for components
Optimal reliability allocation with discrete cost–reliability data for components
1999,
This paper addresses the optimal allocation of reliability among components that are...
Using analogical reasoning and schema formation to improve the success in formulating linear programming models
Using analogical reasoning and schema formation to improve the success in formulating linear programming models
1999,
In this paper we look at alternative ways of teaching linear programming model...
Solving inverse spanning tree problems through network flow techniques
Solving inverse spanning tree problems through network flow techniques
1999,
Given a solution x * and an a priori estimated cost vector c , the inverse...
An O(nm)-time network simplex algorithm for the shortest path problem
An O(nm)-time network simplex algorithm for the shortest path problem
1999,
We present an O(nm) -time network simplex algorithm for finding a tree of shortest...
Rendezvous search on the interval and the circle
Rendezvous search on the interval and the circle
1999,
Two people are placed randomly and independently on a street of unit length. They...
Partition-reversible Markov processes
Partition-reversible Markov processes
1999,
This study introduces a generalization of reversibility called...
Structural analysis of a queueing system with multiclasses of correlated arrivals and blocking
Structural analysis of a queueing system with multiclasses of correlated arrivals and blocking
1999,
In assemble-to-order production systems, and others of a similar flavor, it is often...
Poisson–Voronoi spanning trees with applications to the optimization of communication networks
Poisson–Voronoi spanning trees with applications to the optimization of communication networks
1999,
We define a family of random trees in the plane. Their nodes of level k , k = 0,...
Routing through virtual paths in layered telecommunication networks
Routing through virtual paths in layered telecommunication networks
1999,
We study a network configuration problem in telecommunications where one wants to set...
Decentralized adaptive flow control of high-speed connectionless data networks
Decentralized adaptive flow control of high-speed connectionless data networks
1999,
We introduce a permit-based adaptive control scheme for regulating traffic admission...
Papers per page: