Thesis (S.M.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2004. / Includes bibliographical references (p. 113-114). / This thesis describes several directions to replace the gradient in James Schor's gradient algorithm to solve the dual problem. The alternative directions are: the variance and standard deviation of buffer levels, the deviation of the average buffer level from half-full, the difference between probability of starvation and blocking, and the difference between the production rate upstream and downstream of a buffer. The objective of the new algorithms is to achieve the final production rate of the dual problem faster than the gradient. The decomposition method is used to evaluate the production rates and average buffer levels. We find that the new algorithms work better in lines with no bottlenecks. The variance and standard deviation algorithms work very well in most cases. We also include an algorithm to generate realistic line parameters. This algorithm generate realistic line parameters based on realistic constraints set on them. This algorithm does not involve filtering and is fast and reliable. / by Ketty Tanizar. / S.M.
| Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/28855 |
| Date | January 2004 |
| Creators | Tanizar, Ketty, 1978- |
| Contributors | Stanley B. Gershwin., Massachusetts Institute of Technology. Operations Research Center., Massachusetts Institute of Technology. Operations Research Center |
| Publisher | Massachusetts Institute of Technology |
| Source Sets | M.I.T. Theses and Dissertation |
| Language | en_US |
| Detected Language | English |
| Type | Thesis |
| Format | 114 p., 4025802 bytes, 4039566 bytes, application/pdf, application/pdf, application/pdf |
| Rights | M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission., http://dspace.mit.edu/handle/1721.1/7582 |
Page generated in 0.0014 seconds