Now showing items 305-324 of 372

    • 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 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 ...
    • 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 ...
    • Sensitivity analysis of the Brookhaven energy system optimization model 

      Shapiro, Jeremy F., 1939-; White, David Edwin; Wood, David O. (Massachusetts Institute of Technology, Operations Research Center, 1977)
    • Sensitivity Analysis of the Economic Lot-Sizing Problem 

      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 ...
    • Separable Concave Optimization Approximately Equals 

      Magnanti, Thomas L.; Stratila, Dan (2006-03-13)
    • Separable Concave Optimization Approximately Equals Piecewise-Linear Optimization 

      Magnanti, Thomas L.; Stratila, Dan (Massachusetts Institute of Technology, Operations Research Center, 2012-01-18)
    • Sequential Event Prediction 

      Letham, Benjamin; Rudin, Cynthia; Madigan, David (Massachusetts Institute of Technology, Operations Research Center, 2012-08-29)
    • Shortest Path Algorithms: A Comparison 

      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.
    • Shortest Paths, Network Design and Associated Polyhedra 

      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 ...
    • Single Machine Scheduling with Release Dates 

      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 ...
    • Solution of the Retiring Search Problem 

      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 ...
    • Solving variational inequality and fixed point problems by averaging and optimizing potentials 

      Magnanti, Thomas L.; Perakis, Georgia; Massachusetts Institute of Technology. Operations Research Center (Massachusetts Institute of Technology, Operations Research Center, 1997)
    • Some Abstract Pivot Algorithms 

      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 ...
    • Some Abstract Pivot Algorithms (REVISED) 

      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 ...