Advanced Search
DSpace@MIT

Browsing Operations Research Center by Title

Research and Teaching Output of the MIT Community

Browsing Operations Research Center by Title

Sort by: Order: Results:

  • Robust optimization for network-based resource allocation problems under uncertainty 
    Marla, Lavanya (Massachusetts Institute of Technology, 2007)
    We consider large-scale, network-based, resource allocation problems under uncertainty, with specific focus on the class of problems referred to as multi-commodity flow problems with time-windows. These problems are at the ...
  • Robust optimization, game theory, and variational inequalities 
    Aghassi, Michele Leslie (Massachusetts Institute of Technology, 2005)
    We propose a robust optimization approach to analyzing three distinct classes of problems related to the notion of equilibrium: the nominal variational inequality (VI) problem over a polyhedron, the finite game under payoff ...
  • Robust planning for Effects-Based Operations 
    Bryant, Corban Harrell (Massachusetts Institute of Technology, 2006)
    In this thesis. we introduce and analyze methods of creating theater-level robust mission plans for Effects Based Operations (EBO) of teams of Unmanned Aerial Vehicles (UAVs), and propose methods of effectively presenting ...
  • Robust, risk-sensitive, and data-driven control of Markov Decision Processes 
    Le Tallec, Yann (Massachusetts Institute of Technology, 2007)
    Markov Decision Processes (MDPs) model problems of sequential decision-making under uncertainty. They have been studied and applied extensively. Nonetheless, there are two major barriers that still hinder the applicability ...
  • Route optimization under uncertainty for Unmanned Underwater Vehicles 
    Cates, Jacob Roy (Massachusetts Institute of Technology, 2011)
    As our technology continues to increase, our military wishes to reduce the risk service members endure by using unmanned vehicles. These unmanned vehicles will, over time, become more independent and trustworthy in our ...
  • Routing and scheduling models for robust allocation of slack 
    Chiraphadhanakul, Virot (Massachusetts Institute of Technology, 2010)
    A myriad of uncontrollable factors in airline operations make delays and disruptions unavoidable. Most conventional scheduling models, however, ignore the presence of uncertainties in actual operations in order to limit ...
  • Routing and Scheduling on a Shoreline with Release Times 
    Psaraftis, Harilaos N.; Solomon, Marius M.; Magnanti, Thomas L.; Kim, Tai-Up (Massachusetts Institute of Technology, Operations Research Center, 1986-09)
    In this paper we examine computational complexity issues and develop algorithms for a class of "shoreline" single-vehicle routing and scheduling problems with release time constraints. Problems in this class are interesting ...
  • Routing in Point-to-Point Delivery Systems 
    Leung, Janny M. Y.; Magnanti, Thomas L.; Singhal, Vijay (Massachusetts Institute of Technology, Operations Research Center, 1988-01)
    We develop an optimization-based approach for a point-to-point route planning problem that arises in many large scale delivery systems(for example, less-than-truckload freight, rail, mail and package delivery, communications). ...
  • Routing in probabilistic networks 
    Key, Jonathan Ramsay, 1976- (Massachusetts Institute of Technology, 2004)
    This thesis considers tlhe problem of routing in a network where the travel times along the arcs are modeled as independent random variables. A standard approach to routing in such networks is to select a path with the ...
  • Safety at what price? : setting anti-terrorist policies for checked luggage on US domestic aircraft 
    Cohen, Jonathan E. W. (Jonathan Ephraim Weis), 1976- (Massachusetts Institute of Technology, 2000)
  • Scheduling a Make-To-Stock Queue: Index Policies and Hedging Points 
    Veatch, Michael H.; Wein, Lawrence M. (Massachusetts Institute of Technology, Operations Research Center, 1992-09)
    A single machine produces several different classes of items in a make-to-stock mode. We consider the problem of scheduling the machine to regulate finished goods inventory, minimizing holding and backorder or holding and ...
  • Scheduling Manufacturing Systems With Work-in-Process Inventory Control: Single-Part-Type Systems 
    Bai, X.; Gershwin, Stanley B. (Massachusetts Institute of Technology, Operations Research Center, 1990-06)
    In this paper, a real-time feedback control algorithm is developed for scheduling single-part-type production lines in which there are three important classes of activities: operations, failures, and starvation or blockage. ...
  • Scheduling multiclass queueing networks and job shops using fluid and semidefinite relaxations 
    Sethuraman, Jayachandran, 1970- (Massachusetts Institute of Technology, 1999)
  • Scheduling Networks of Queues: Heavy Traffic Analysis of a Multistation Closed Network 
    Chevalier, Philippe B.; Wein, Lawrence M. (Massachusetts Institute of Technology, Operations Research Center, 1990-07)
    We consider the problem of finding an optimal dynamic priority sequencing policy to maximize the mean throughput rate in a multistation, multiclass closed queueing network with general service time distributions and a ...
  • Scheduling Workforce and Workflow in a Service Factory 
    Berman, Oded; Larson, Richard C., 1943- (Massachusetts Institute of Technology, Operations Research Center, 1994-02)
    We define a service factory to be a network of service-related-workstations, at which assigned workers process work-in-progress that flows through the workstations. Examples of service factory work include mail processing ...
  • Selfish versus coordinated routing in network games 
    Stier Moses, Nicolás E (Massachusetts Institute of Technology, 2004)
    A common assumption in network optimization models is that a central authority controls the whole system. However, in some applications there are independent users, and assuming that they will follow directions given by ...
  • Sensitivity analysis for variational inequalities 
    Qiu, Yuping; Magnanti, Thomas L.; Massachusetts Institute of Technology. Operations Research Center (Massachusetts Institute of Technology, Operations Research Center, 1987)
  • Sensitivity analysis for variational inequalities defined on polyhedral sets 
    Qiu, Yuping; Magnanti, Thomas L.; Massachusetts Institute of Technology. Operations Research Center (Massachusetts Institute of Technology, Operations Research Center, 1987)
  • Sensitivity Analysis in Integer Programming 
    Shapiro, Jeremy F., 1939- (Massachusetts Institute of Technology, Operations Research Center, 1976-02)
    Not Available
  • Sensitivity Analysis of List Scheduling Heuristics 
    Kolen, A.W. J.; Rinnooy Kan, A. H. G.; Van Hoesel, C. P. M.; Wagelmans, Albert (Massachusetts Institute of Technology, Operations Research Center, 1990-10)
    When jobs have to be processed on a set of identical parallel machines so as to minimize the makespan of the schedule, list scheduling rules form a popular class of heuristics. The order in which jobs appear on the list ...
MIT-Mirage