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:

  • 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 ...
  • 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 ...
  • 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 ...
  • Qiu, Yuping; Magnanti, Thomas L.; Massachusetts Institute of Technology. Operations Research Center (Massachusetts Institute of Technology, Operations Research Center, 1987)
  • Qiu, Yuping; Magnanti, Thomas L.; Massachusetts Institute of Technology. Operations Research Center (Massachusetts Institute of Technology, Operations Research Center, 1987)
  • Shapiro, Jeremy F., 1939- (Massachusetts Institute of Technology, Operations Research Center, 1976-02)
    Not Available
  • 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 ...
  • Shapiro, Jeremy F., 1939-; White, David Edwin; Wood, David O. (Massachusetts Institute of Technology, Operations Research Center, 1977)
  • Van Hoesel, Stan; Wagelmans, Albert (Massachusetts Institute of Technology, Operations Research Center, 1990-11)
    In this paper we study sensitivity analysis of the uncapacitated single level economic lot-sizing problem, which was introduced by Wagner and Whitin about thirty years ago. In particular we are concerned with the computation ...
  • Magnanti, Thomas L.; Stratila, Dan (2006-03-13)
  • Magnanti, Thomas L.; Stratila, Dan (Massachusetts Institute of Technology, Operations Research Center, 2012-01-18)
  • Letham, Benjamin; Rudin, Cynthia; Madigan, David (Massachusetts Institute of Technology, Operations Research Center, 2012-08-29)
  • Golden, Bruce L., 1950- (Massachusetts Institute of Technology, Operations Research Center, 1975-10)
    In this note we present some computational evidence to suggest that a version of Bellman's shortest path algorithm outperforms Treesort- Dijkstra's for a certain class of networks.
  • Magnanti, Thomas L.; Mirchandani, Prakash (Massachusetts Institute of Technology, Operations Research Center, 1990-04)
    We study a specialized version of network design problems that arise in telecommunication, transportation and other industries. The problem, a generalization of the shortest path problem, is defined on an undirected network ...
  • Goemans, Michel X.; Queyranne, Maurice; Schulz, Andreas S.; Skutella, Martin; Wang, Yaoguang (Massachusetts Institute of Technology, Operations Research Center, 1999-10)
    We consider the scheduling problem of minimizing the average weighted completion time of n jobs with release dates on a single machine. We first study two linear programming relaxations of the problem, one based on a ...
  • Lobel, Ilan (Massachusetts Institute of Technology, 2009)
    This thesis studies the learning problem of a set of agents connected via a general social network. We address the question of how dispersed information spreads in social networks and whether the information is efficiently ...
  • Morse, Philip M., 1903- (Massachusetts Institute of Technology, Operations Research Center, 1977-12)
    The well-known variational principle of the optimal distribution of search effort is applied to the case where the sought-for target has been located momentarily but the search cannot begin until a time T o later, during ...
  • Magnanti, Thomas L.; Perakis, Georgia; Massachusetts Institute of Technology. Operations Research Center (Massachusetts Institute of Technology, Operations Research Center, 1997)
  • Green, Curtis; Magnanti, Thomas L. (Massachusetts Institute of Technology, Operations Research Center, 1974-02)
    Several problems in the theory of combinatorial geometries (or matroids) are solved by means of algorithms which involve the notion of "abstract pivots". The main example is the Edmonds-Fulkerson partition theorem, which ...
  • Green, Curtis; Magnanti, Thomas L. (Massachusetts Institute of Technology, Operations Research Center, 1974-08)
    Several problems in the theory of combinatorial geometries (or matroids) are solved by means of algorithms which involve the notion of "abstract pivots". The main example is the Edmonds-Fulkerson partition theorem, which ...
MIT-Mirage