Research focuses on developing Brownian approximations of mathematically intractable dynamic scheduling (or resource allocation) problems in order to develop effective scheduling policies for a variety of production systems. These systems include multiclass, multistation closed queueing networks (which are perhaps the most prominent mathematical models of manufacturing, computer, and communication systems), make-to-stock queueing systems (that is, production/inventory systems, where the production system is modeled as a queueing system) with random yields and substitutable demands (motivated by semiconductor manufacturing), and multiechelon repairable inventory systems.//

Agency
National Science Foundation (NSF)
Institute
Division of Civil, Mechanical, and Manufacturing Innovation (CMMI)
Application #
9057297
Program Officer
Lawrence M. Seiford
Project Start
Project End
Budget Start
1990-09-01
Budget End
1996-08-31
Support Year
Fiscal Year
1990
Total Cost
$312,500
Indirect Cost
Name
Massachusetts Institute of Technology
Department
Type
DUNS #
City
Cambridge
State
MA
Country
United States
Zip Code
02139