2026-09-19T13:43:43Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/288552021-07-05T14:03:20Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Stanley B. Gershwin.
Tanizar, Ketty, 1978-
Massachusetts Institute of Technology. Operations Research Center.
Massachusetts Institute of Technology. Operations Research Center
Sloan School of Management
2005-09-27T18:42:51Z
2005-09-27T18:42:51Z
2004
2004
http://hdl.handle.net/1721.1/28855
60405191
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.
114 p.
4025802 bytes
4039566 bytes
application/pdf
application/pdf
en_US
Massachusetts Institute of Technology
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
Operations Research Center.
Alternatives to the gradient in optimal transfer line buffer allocation
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="8cdbcc3a-8852-4374-8863-0644f1ca6bcc">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>en_US</Language>
<Title>Alternatives to the gradient in optimal transfer line buffer allocation</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2004</PublicationDate>
<Authors>
<Author>
<DisplayName>Tanizar, Ketty, 1978-</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Operations Research Center.</Keyword>
<Abstract>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.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>