Browsing Operations Research Center Working Papers by Title
Now showing items 89-108 of 372
-
Dynamic Pricing: A learning Approach
(Massachusetts Institute of Technology, Operations Research Center, 2001-08)We present an optimization approach for jointly learning the demand as a functionof price, and dynamically setting prices of products in an oligopoly environment in order to maximize expected revenue. The models we consider ... -
Dynamic Scheduling of a Production/Inventory System with By-Products and Random Yield
(Massachusetts Institute of Technology, Operations Research Center, 1991-05)Motivated by semiconductor wafer fabrication, we consider a scheduling problem for a single-server multiclass queue. A single workstation fabricates semiconductor wafers according to a variety of different processes, where ... -
Economic Lot-Sizing with Start-up Costs: The Convex Hull
(Massachusetts Institute of Technology, Operations Research Center, 1991-02)A partial description of the convex hull of solutions to the economic lot-sizing problem with start-up costs (ELSS) has been derived recently. Here a larger class of valid inequalities is given and it is shown that these ... -
The Effect of Removing Accidents Repeaters From the Road
(Massachusetts Institute of Technology, Operations Research Center, 1971-12)In newspaper editorials, public commentaries and the like, licensing authorities are often advised to solve the "accident problem" by taking the "nut behind the wheel" off the road. This paper uses six-year driver records ... -
The Effect of the 18-Year Old Drinking Age on Auto Accidents
(Massachusetts Institute of Technology, Operations Research Center, 1974-05)The effect of Massachusetts' reduced drinking age on auto accidents is examined by employing an interrupted time series analysis of monthly accident data covering the period January, 1969, through September 1973. The data ... -
Efficient Computation of Probabilities of Events Described by Order Statistics and Application to a Problem of Queues
(Massachusetts Institute of Technology, Operations Research Center, 1991-05)Consider a set of N i.i.d. random variables in [0, 1]. When the experimental values of the random variables are arranged in ascending order from smallest to largest, one has the order statistics of the set of random ... -
Efficient Computation of Probabilities of Events Described by Order Statistics and Applications to Queue Inference
(Massachusetts Institute of Technology, Operations Research Center, 1994-03)This paper derives recursive algorithms for efficiently computing event probabilities related to order statistics and applies the results in a queue inferencing setting. Consider a set of N i.i.d. random variables in [0, ... -
An Efficient Model for Planning Bus Routes in Communities with Populations Between 20,000 and 250,000
(Massachusetts Institute of Technology, Operations Research Center, 1973-11)The paper discusses a flexible, inexpensive, interactive computer model specifically designed to act as an aid for planning routes for conventional bus systems in communities with populations between 20,000 and 250,000. ... -
Efficient reliability computation of some highly structured networks
(Massachusetts Institute of Technology, Operations Research Center, 1985) -
An Efficient Rescaled Perceptron Algorithm for Conic Systems
(2006-09-22) -
Equilibration operators for the solution of constrained matrix problems
(Massachusetts Institute of Technology, Operations Research Center, 1989) -
Equilibria on a congested transportation network
(Massachusetts Institute of Technology, Operations Research Center, 1980) -
Equipment selection and task assignment for multiproduct assembly system design
(Massachusetts Institute of Technology, Operations Research Center, 1987) -
Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model
(Massachusetts Institute of Technology, Operations Research Center, 2009-02-03) -
Estimating the Lead Time Distribution of Priority Lots in a Semiconductor Factory
(Massachusetts Institute of Technology, Operations Research Center, 1994-05)We consider the lead time of priority lots in a semiconductor factory. The main cause of delays is waiting for repairs of failed machines, and the failures are mainly caused by power disturbances. This can be modeled as ... -
An exact FCFS waiting-time analysis for a general class of G/G/s queueing systems
(Massachusetts Institute of Technology, Operations Research Center, 1987) -
Exact solution for the Bradford distribution and its use in modelling informational data
(Massachusetts Institute of Technology, Operations Research Center, 1977) -
Extended Vacation Systems and the Universality of the M/G/1/K Blocking Formula
(Massachusetts Institute of Technology, Operations Research Center, 1989-03)A simple blocking formula B(K) = (1 - p)EK [1 - pEK]- 1 relates the probability of blocking for the finite capacity M/G/1/K to EK, the steady state occupancy tail probability of the same system with infinite capacity. The ... -
Extensions to the dynamic requirements planning model
(Massachusetts Institute of Technology, Operations Research Center, 1995) -
Extremum Properties of Hexagonal Partitioning and the Uniform Distribution in Euclidean Location
(Massachusetts Institute of Technology, Operations Research Center, 1985-01)