Skip navigation
  • Home
  • Browse
    • Communities
      & Collections
    • Browse Items by:
    • Publication Date
    • Author
    • Title
    • Subject
    • Department
  • Sign on to:
    • My MacSphere
    • Receive email
      updates
    • Edit Profile


McMaster University Home Page
  1. MacSphere
  2. Open Access Dissertations and Theses Community
  3. Open Access Dissertations and Theses
Please use this identifier to cite or link to this item: http://hdl.handle.net/11375/7033
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorParlar, Mahmuten_US
dc.contributor.advisorLove, Robert F.en_US
dc.contributor.advisorMohanty, Sri Gopalen_US
dc.contributor.authorÇetinkaya, Silaen_US
dc.date.accessioned2014-06-18T16:37:50Z-
dc.date.available2014-06-18T16:37:50Z-
dc.date.created2010-07-02en_US
dc.date.issued1996-06en_US
dc.identifier.otheropendissertations/2330en_US
dc.identifier.other3400en_US
dc.identifier.other1380562en_US
dc.identifier.urihttp://hdl.handle.net/11375/7033-
dc.description.abstract<p>In this thesis we study a typical retailer's problem characterized by a slngle item, periodic review of inventory levels in a multi-period setting: and stochastic demands. We consider the case of full backlogging where backorders are penalized via fixed and proportional backorder costs simultaneously. This treatment of backorder costs is a nonstandard aspect of our study. The discussion begins with an introduction in Chapter 1. Next, a review of the relevant literature is provided in Chapter 2. In Chapter 3 we study the infinite horizon case which is of both theoretical and practical interest. From a theoretical point of view tile infinite horizon solution represents the limiting behavior of the finite horizon case. Solving the infinite horizon problem has also its own practical benefits since its solution is easier to compute. Our motivation to study the infinite horizon case in the first place is pragmatic. We prove that a myopic base-stock policy is optimal for the infinite horizon case, and this result provides a basis for our study. We show that the optimal myopic policy can be computed easily for the Erlang demand in Chapter 4; solve a disposal problem which arises under the myopic policy in Chapter 5, and also study in Chapters 6 and 7 the finite horizon problem for which a myopic policy is not optimal. For the finite horizon problem computation of the exact policy may require a substantial effort. From a computational point of view, there is a need for developing a method that overcomes this burden. In Chapter 6 we develop a model for such a method by restricting our attention to the class of myopic base-stock policies, and call the resulting policy the 'best myopic' policy. We discuss analytical and numerical results for the computation of the best myopic policy in Chapter 7. Finally we present a summary of our main findings in Chapter 8.</p>en_US
dc.subjectManagement Sciences and Quantitative Methodsen_US
dc.subjectManagement Sciences and Quantitative Methodsen_US
dc.titleMyopic Policies for Inventory Controlen_US
dc.typethesisen_US
dc.contributor.departmentManagement Science/Systemsen_US
dc.description.degreeDoctor of Philosophy (PhD)en_US
Appears in Collections:Open Access Dissertations and Theses

Files in This Item:
File SizeFormat 
fulltext.pdf
Open Access
4.04 MBAdobe PDFView/Open
Show simple item record Statistics


Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.

Sherman Centre for Digital Scholarship     McMaster University Libraries
©2022 McMaster University, 1280 Main Street West, Hamilton, Ontario L8S 4L8 | 905-525-9140 | Contact Us | Terms of Use & Privacy Policy | Feedback

Report Accessibility Issue