Browsing Operations Research Center by Title
Now showing items 189-208 of 372
-
Modeling Travel Times in Dynamic Transportation Networks; A Fluid Dynamics Approach
(Massachusetts Institute of Technology, Operations Research Center, 2001-04)In this paper, we take a fluid dynamics approach to determine the travel time in traversing a network's link. We propose a general model for travel time functions that utilizes fluid dynamics laws for compressible flow to ... -
Models and algorithms for transient queueing congestion at a hub airport
(Massachusetts Institute of Technology, Operations Research Center, 1992) -
Models and Methods for Merge-In-Transit Operations
(Massachusetts Institute of Technology, Operations Research Center, 2001-09)We develop integer programming formulations and solution methods for addressing operational issues in merge-in-transit distribution systems. The models account for various complex problem features including the integration ... -
Models for planning the evolution of local telecommunication networks
(Massachusetts Institute of Technology, Operations Research Center, 1989) -
Models of flexible workforces in stochastic service environments : the one-job case
(Massachusetts Institute of Technology, Operations Research Center, 1995) -
Monotone Control of Queueing and Production/Inventory Systems
(Massachusetts Institute of Technology, Operations Research Center, 1991-08)Weber and Stidham (1987) used submodularity to establish transition monotonicity (a service completion at one station cannot reduce the service rate at another station) for Markovian queueing networks that meet certain ... -
Monotone Control of Queueing and Production/Inventory Systems
(Massachusetts Institute of Technology, Operations Research Center, 1991-08)Weber and Stidham (1987) used submodularity to establish transition monotonicity (a service completion at one station cannot reduce the service rate at another station) for Markovian queueing networks that meet certain ... -
The Multi-Airport Ground-Holding Problem in Air Traffic Control
(Massachusetts Institute of Technology, Operations Research Center, 1992-02)In 1986, the total profits of the U.S. airline industry were of the order of $800 million, while its total delay costs due to congestion approached the figure of $2 billion. Motivated by this important problem of congestion ... -
A Multi-Exchange Neighborhood Search Heuristic for an Integrated Clustering and Machine Setup Model for PCB Manufacturing
(Massachusetts Institute of Technology, Operations Research Center, 2001-03)In the manufacture of printed circuit boards, electronic components are attached to a blank board by one or more pick-and-place machines. Frequent machine setups, though time consuming, can reduce overall processing time. ... -
The Multi-Network Design Problem
(Massachusetts Institute of Technology, Operations Research Center, 1991-12)This paper studies a new multi-facility network synthesis problem, called the Multi-level Network Design (MLND) problem, that arises in the topological design of hierarchical communication, transportation, and electric ... -
A multiclass hybrid production center in heavy traffic
(Massachusetts Institute of Technology, Operations Research Center, 1994) -
Multiclass queueing systems in heavy traffic: an asymptotic approach based on distributional and conservation laws
(Massachusetts Institute of Technology, Operations Research Center, 1993-10)We propose a new approach to analyze multiclass queueing systems in heavy traffic based on what we consider as fundamental laws in queueing systems, namely distributional and conservation laws. Methodologically, we extend ... -
Multicommodity network flows : computational experience
(Massachusetts Institute of Technology, Operations Research Center, 1976) -
An N Server Cutoff Multi-Priority Queue
(Massachusetts Institute of Technology, Operations Research Center, 1985-02)Consider a multi-priority, nonpreemptive, N-server Poisson arrival queueing system. Service times are negative exponential. In order to save available servers for higher priority customers, arriving customers of each lower ... -
An N Server Cutoff Priority Queue Where Customers Request a Random Number of Servers
(Massachusetts Institute of Technology, Operations Research Center, 1985-05)Consider a multi-priority, nonpreemptive, N-server Poisson arrival queueing system. The number of servers requested by an arrival has a known probability distribution. Service times are negative exponential. In order to ... -
A nested decomposition method for vehicle routing and scheduling
(Massachusetts Institute of Technology, Operations Research Center, 1987) -
Network Flow Models for Designing Diameter-Constrained Minimum Spanning and Steiner Trees
(Massachusetts Institute of Technology, Operations Research Center, 2001-08)The Diameter-Constrained Minimum Spanning Tree Problem seeks a least cost spanning tree subject to a (diameter) bound imposed on the number of edges in the tree between any node pair. A traditional multicommodity flow model ... -
Network Flows
(Massachusetts Institute of Technology, Operations Research Center, 1988-08)Not Available -
Networks as an aid in transportation and contingency planning
(Massachusetts Institute of Technology, Operations Research Center, 1983) -
Networks of Non-homogeneous M/G/oo Systems
(Massachusetts Institute of Technology, Operations Research Center, 1990-01)For a network of G/oo service facilities, the transient joint distribution of the facility populations is found to have a simple Poisson product form with simple explicit formula for the means. In the network it is assumed ...
