Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/102760
DC Field | Value | |
---|---|---|
dc.title | A simple heuristic for multi-product dynamic lot sizing problems | |
dc.contributor.author | Chan, G.H. | |
dc.contributor.author | Chiu, K.S. | |
dc.date.accessioned | 2014-10-28T02:29:23Z | |
dc.date.available | 2014-10-28T02:29:23Z | |
dc.date.issued | 1997-10 | |
dc.identifier.citation | Chan, G.H.,Chiu, K.S. (1997-10). A simple heuristic for multi-product dynamic lot sizing problems. Computers and Operations Research 24 (10) : 969-979. ScholarBank@NUS Repository. | |
dc.identifier.issn | 03050548 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/102760 | |
dc.description.abstract | In a multi-product dynamic lot sizing problem, besides a separate minor setup cost for each product produced, a major setup cost is incurred when at least one product is produced in a period. The objective is to determine the product lot sizes, over a finite planning horizon, that will minimize the total relevant cost. A simple extension of the one-way-eyeballing-heuristic (OWEH) to a multi-product algorithm is given. Computational experience on realistically sized problems (30 products, 50 time periods) show inefficiency is about 10% of the optimum. © 1997 Elsevier Science Ltd. | |
dc.source | Scopus | |
dc.type | Article | |
dc.contributor.department | MATHEMATICS | |
dc.description.sourcetitle | Computers and Operations Research | |
dc.description.volume | 24 | |
dc.description.issue | 10 | |
dc.description.page | 969-979 | |
dc.description.coden | CMORA | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.