MIT Libraries homeMIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • Singapore-MIT Alliance (SMA)
  • Innovation in Manufacturing Systems and Technology (IMST)
  • View Item
  • DSpace@MIT Home
  • Singapore-MIT Alliance (SMA)
  • Innovation in Manufacturing Systems and Technology (IMST)
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

The Complexity of Safety Stock Placement in General-Network Supply Chains

Author(s)
Lesnaia, Ekaterina; Vasilescu, Iuliu; Graves, Stephen C.
Thumbnail
DownloadIMST033.pdf (96.90Kb)
Metadata
Show full item record
Abstract
We consider the optimization problem of safety stock placement in a supply chain, as formulated in [1]. We prove that this problem is NP-Hard for supply chains modeled as general acyclic networks. Thus, we do not expect to find a polynomial-time algorithm for safety stock placement for a general-network supply chain.
Date issued
2005-01
URI
http://hdl.handle.net/1721.1/7537
Series/Report no.
Innovation in Manufacturing Systems and Technology (IMST);
Keywords
Complexity, safety stock placement, supply chain planning

Collections
  • Innovation in Manufacturing Systems and Technology (IMST)

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries homeMIT Libraries logo

Find us on

Twitter Facebook Instagram YouTube RSS

MIT Libraries navigation

SearchHours & locationsBorrow & requestResearch supportAbout us
PrivacyPermissionsAccessibility
MIT
Massachusetts Institute of Technology
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.