Advanced Search
DSpace@MIT

Browsing Operations Research Center Working Papers by Title

Research and Teaching Output of the MIT Community

Browsing Operations Research Center Working Papers by Title

Sort by: Order: Results:

  • Ellis, Howard M.; Keeney, Ralph L. (Massachusetts Institute of Technology, Operations Research Center, 1971-08)
    This paper addresses a problem common to many government agencies--trying to specify a regulatory policy that is in some sense best for a given situation. Such questions demand the consideration of multiple conflicting ...
  • Ruark, John Douglas, 1971-; Massachusetts Institute of Technology. Operations Research Center (Massachusetts Institute of Technology, Operations Research Center, 1998)
  • Schaack, Christian; Larson, Richard C., 1943-; Massachusetts Institute of Technology. Operations Research Center (Massachusetts Institute of Technology, Operations Research Center, 1984)
  • Bertsimas, Dimitris J.; Nino-Mora, Jose (Massachusetts Institute of Technology, Operations Research Center, 1994-08)
    We propose a mathematical programming approach for the classical PSPACE - hard problem of n restless bandits in stochastic optimization. We introduce a series of n increasingly stronger linear programming relaxations, the ...
  • Myung, Young-soo; Tcha, Dong-wan (Massachusetts Institute of Technology, Operations Research Center, 1991-05)
    We consider how the optimal decision can be made if the optimality criterion of maximizing profit changes to that of maximizing return on investment for the general uncapacitated facility location problem. We show that the ...
  • Keeney, Ralph L. (Massachusetts Institute of Technology, Operations Research Center, 1971-06)
    The concepts of conditional risk aversion, the conditional risk premium, and risk independence pertaining to multiattributed utility functions are defined. The latter notion is then generalized to what is called utility ...
  • 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 ...
  • 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). ...
  • 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 ...
  • 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. ...
  • 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 ...
  • 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)
MIT-Mirage