DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/10578
Full metadata record
DC FieldValueLanguage
dc.contributor.authorChanda, Udayan
dc.contributor.authorNagpal, Gaurav
dc.contributor.authorJasti, Naga Vamsi Krishna
dc.date.accessioned2023-04-29T06:42:40Z
dc.date.available2023-04-29T06:42:40Z
dc.date.issued2022-07
dc.identifier.urihttps://dl.acm.org/doi/abs/10.4018/IJEA.306241
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/10578
dc.description.abstractIn this paper, the multi-period EOQ model is developed for the technology products that have multiple generations co-existing in the market, with each of them having a very short product life cycle. The paper first develops the framework for computation of inventory-related costs and then minimizes the total replenishment costs using random search technique and approximating the non-linear expressions while using Simpson’s Rule for integration. The paper also provides numerical illustrations and establishes a few important theorems that relate the EOQ to the innovation of diffusions. It is found that the total replenishment cost curve, drawn on the EOQ axis in the case of technology generations is convex to the origin. Since the objective function is highly non-linear, the genetic algorithm has been used to find the solution to the problem. The study also suggests that the faster diffusion of the next generations has a conflicting effect on the EOQ of the first generation in the case of pooled and non-pooled logistics.en_US
dc.language.isoenen_US
dc.publisherACM Digital Libraryen_US
dc.subjectManagementen_US
dc.subjectEOQ Modelen_US
dc.subjectLife Cyclesen_US
dc.titleMulti-Period EOQ Model for Multi-Generation Technology Products With Short Product Life Cyclesen_US
dc.typeArticleen_US
Appears in Collections:Department of Management

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


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