Fully polynomial time approximation schemes for sequential decision problems
Massachusetts Institute of Technology. Operations Research Center.
James B. Orlin.
MetadataShow full item record
This thesis is divided into two parts sharing the common theme of fully polynomial time approximation schemes. In the first part, we introduce a generic approach for devising fully polynomial time approximation schemes for a large class of problems that we call list scheduling problems. Our approach is simple and unifying, and many previous results in the literature follow as direct corollaries of our main theorem. In the second part, we tackle a more difficult problem; the stochastic lot sizing problem, and give the first fully polynomial time approximation scheme for it. Our approach is based on simple techniques that could arguably have wider applications outside of just designing fully polynomial time approximation schemes.
Thesis (S.M.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2005.Includes bibliographical references (p. 65-67).
DepartmentMassachusetts Institute of Technology. Operations Research Center.; Massachusetts Institute of Technology. Operations Research Center; Sloan School of Management
Massachusetts Institute of Technology
Operations Research Center.