Browsing Operations Research Center Working Papers by Title
Now showing items 305324 of 372

Scheduling a MakeToStock Queue: Index Policies and Hedging Points
(Massachusetts Institute of Technology, Operations Research Center, 199209)A single machine produces several different classes of items in a maketostock 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 WorkinProcess Inventory Control: SinglePartType Systems
(Massachusetts Institute of Technology, Operations Research Center, 199006)In this paper, a realtime feedback control algorithm is developed for scheduling singleparttype 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
(Massachusetts Institute of Technology, Operations Research Center, 199007)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
(Massachusetts Institute of Technology, Operations Research Center, 199402)We define a service factory to be a network of servicerelatedworkstations, at which assigned workers process workinprogress that flows through the workstations. Examples of service factory work include mail processing ... 
Sensitivity analysis for variational inequalities
(Massachusetts Institute of Technology, Operations Research Center, 1987) 
Sensitivity analysis for variational inequalities defined on polyhedral sets
(Massachusetts Institute of Technology, Operations Research Center, 1987) 
Sensitivity Analysis in Integer Programming
(Massachusetts Institute of Technology, Operations Research Center, 197602)Not Available 
Sensitivity Analysis of List Scheduling Heuristics
(Massachusetts Institute of Technology, Operations Research Center, 199010)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
(Massachusetts Institute of Technology, Operations Research Center, 1977) 
Sensitivity Analysis of the Economic LotSizing Problem
(Massachusetts Institute of Technology, Operations Research Center, 199011)In this paper we study sensitivity analysis of the uncapacitated single level economic lotsizing 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
(20060313) 
Separable Concave Optimization Approximately Equals PiecewiseLinear Optimization
(Massachusetts Institute of Technology, Operations Research Center, 20120118) 
Sequential Event Prediction
(Massachusetts Institute of Technology, Operations Research Center, 20120829) 
Shortest Path Algorithms: A Comparison
(Massachusetts Institute of Technology, Operations Research Center, 197510)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
(Massachusetts Institute of Technology, Operations Research Center, 199004)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
(Massachusetts Institute of Technology, Operations Research Center, 199910)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
(Massachusetts Institute of Technology, Operations Research Center, 197712)The wellknown variational principle of the optimal distribution of search effort is applied to the case where the soughtfor 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
(Massachusetts Institute of Technology, Operations Research Center, 1997) 
Some Abstract Pivot Algorithms
(Massachusetts Institute of Technology, Operations Research Center, 197402)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 EdmondsFulkerson partition theorem, which ... 
Some Abstract Pivot Algorithms (REVISED)
(Massachusetts Institute of Technology, Operations Research Center, 197408)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 EdmondsFulkerson partition theorem, which ...