Please use this identifier to cite or link to this item: https://repository.iimb.ac.in/handle/123456789/660
DC FieldValueLanguage
dc.contributor.authorRao, Arza Keshavaen_US
dc.contributor.authorRao, Mendu Rammohanen_US
dc.date.accessioned2012-07-26T11:27:43Z
dc.date.accessioned2016-01-01T07:06:18Z
dc.date.accessioned2019-05-27T08:41:28Z-
dc.date.available2012-07-26T11:27:43Z
dc.date.available2016-01-01T07:06:18Z
dc.date.available2019-05-27T08:41:28Z-
dc.date.copyright1993en_US
dc.date.issued1993
dc.identifier.otherWP_IIMB_36-
dc.identifier.urihttp://repository.iimb.ac.in/handle/123456789/660-
dc.description.abstractIn the past, researchers presented a linear programming formulation for the economic sizing of warehouses when demand is highly seasonal and public warehouse space is available on a monthly basis. The static model was extended for the dynamic sizing problem in which the warehouse size is allowed to change over time. By applying simplex routine, the optimal size of the warehouse to be constructed could be determined . In this paper, an alternative and simple method of arriving at an optimal solution for the static problem is given. Four extensions of the static model are given. These extensions involve initial warehouse capacity,costs varying over time, economies of scale in capital expenditure and/or operating cost and stochastic version. The dynamic warehouse sizing problem is shown to be a network flow problem which could be solved by using network flow algorithms. The structure of an optimal solution is also given. The concave cost version of the dynamic warehouse sizing problem is also discussed.
dc.language.isoenen_US
dc.publisherIndian Institute of Management Bangalore-
dc.relation.ispartofseriesIIMB Working Paper-36-
dc.subjectEconomic sizing-
dc.subjectWarehousing-
dc.titleEconomic sizing of warehouses: some extensionsen_US
dc.typeWorking Paper
dc.pages21p.
dc.identifier.accessionE3965
Appears in Collections:1993
Files in This Item:
File Description SizeFormat 
wp.iimb.36.pdf1.3 MBAdobe PDFView/Open
Show simple item record

Google ScholarTM

Check


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