Please use this identifier to cite or link to this item:
http://hdl.handle.net/11375/5470
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Miltenburg, G. John | en_US |
dc.contributor.author | McMaster University, Faculty of Business | en_US |
dc.date.accessioned | 2014-06-17T20:40:51Z | - |
dc.date.available | 2014-06-17T20:40:51Z | - |
dc.date.created | 2013-12-23 | en_US |
dc.date.issued | 1983-01 | en_US |
dc.identifier.other | dsb/130 | en_US |
dc.identifier.other | 1129 | en_US |
dc.identifier.other | 4944153 | en_US |
dc.identifier.uri | http://hdl.handle.net/11375/5470 | - |
dc.description | <p>15, 6 p. : ; Includes bibliographical references (p. 14-15). ; "January 1983."</p> | en_US |
dc.description.abstract | <p>Inventory control models which provide co-ordinated control (or joint replenishment) of families of items are very useful in practice. An important component of these models is the algorithm for allocating a total replenishment order among the items in the family. In this paper the allocation algorithm from a new class of co-ordinated control models is discussed. Inventory position is modelled as a diffusion process, and both continuous review and periodic review situations are considered. This new class of co-ordinated control models has been shown to outperform existing models (IBM's IMPACT Inventory Control Package).</p> | en_US |
dc.relation.ispartofseries | Research and working paper series (McMaster University. Faculty of Business) | en_US |
dc.relation.ispartofseries | no. 197 | en_US |
dc.subject | Business | en_US |
dc.subject | Business | en_US |
dc.subject.lcc | Inventory control > Mathematical models | en_US |
dc.title | Allocating a replenishment order among a family of items | en_US |
dc.type | article | en_US |
Appears in Collections: | DeGroote School of Business Working Paper Series |
Files in This Item:
File | Size | Format | |
---|---|---|---|
fulltext.pdf | 582.61 kB | Adobe PDF | View/Open |
Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.