MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • Operations Research Center
  • Operations Research Center Working Papers
  • View Item
  • DSpace@MIT Home
  • Operations Research Center
  • Operations Research Center Working Papers
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Optimal Control of Two-Station Tandem Production/Inventory System

Author(s)
Veatch, Michael H.; Wein, Lawrence M.
Thumbnail
DownloadOR-264-92.pdf (1.461Mb)
Metadata
Show full item record
Abstract
A manufacturing facility consisting of two stations in tandem operates in a maketo-stock mode: after production, items are placed in a finished goods inventory that services an exogenous demand. Demand that cannot be met from inventory is backordered. Each station is modelled as a queue with controllable production rate, and the problem is to control these rates to minimize inventory holding and backordering costs. Optimal controls are computed using dynamic programming and compared with kanban and buffer control mechanisms, popular in manufacturing, and with the base stock mechanism popular in inventory/distribution systems. Conditions are found under which certain simple controls are optimal using stochastic coupling arguments. Insights are gained into when to hold work-in-process and finished goods inventory, comparable to previous studies of production lines in make-to-order and unlimited demand ("push") environments.
Date issued
1992-02
URI
http://hdl.handle.net/1721.1/5214
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 264-92

Collections
  • Operations Research Center Working Papers

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.