Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/45087
Title: Multi-item inventory staggering problems: Heuristics and bounds
Authors: Teo, Chung-Piaw 
Ou, Jihong 
Tan, Kok-Choon 
Issue Date: 1998
Source: Teo, Chung-Piaw,Ou, Jihong,Tan, Kok-Choon (1998). Multi-item inventory staggering problems: Heuristics and bounds. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms : 584-593. ScholarBank@NUS Repository.
Abstract: The staggering problem in the management of a Single Resource Multi-item Inventory System (SRMIS) was studied. This problem was solved by finding a near optimal staggering policy for all the items, assuming that the sizes of all the orders are predetermined. The objective of the staggering problem is to minimize peak storage requirement over time.
Source Title: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
URI: http://scholarbank.nus.edu.sg/handle/10635/45087
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

147
checked on Dec 9, 2017

Google ScholarTM

Check


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