Please use this identifier to cite or link to this item:
http://localhost:8080/xmlui/handle/123456789/1428Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Srinivas, Chidurala | - |
| dc.contributor.author | Rao, C. S. P. | - |
| dc.date.accessioned | 2024-11-12T05:31:45Z | - |
| dc.date.available | 2024-11-12T05:31:45Z | - |
| dc.date.issued | 2010 | - |
| dc.identifier.citation | 10.1007/s00170-009-2286-2 | en_US |
| dc.identifier.uri | http://localhost:8080/xmlui/handle/123456789/1428 | - |
| dc.description | NITW | en_US |
| dc.description.abstract | In this article, we have developed four consignment stock inventory models of supply chain. The lead time is assumed to be dependent because, at the time of contract with the manufacturer, the retailer may intend to reduce the lead time for which the retailers pay an additional cost. The lead time of consignment stock strategy has been controlled to minimize joint total expected cost and simultaneously optimize other decision variables such as quantity transported, lead time, number of transport operations, and delay deliveries under stochastic environment so as to gain the competitive advantage in the business strategy. Numerical examples and sensitivity analysis are presented to illustrate the solution procedure | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | International Journal of Advanced Manufacturing Technology | en_US |
| dc.subject | Consignment stock | en_US |
| dc.subject | Single-vendor–multibuyer model | en_US |
| dc.subject | Supply chain | en_US |
| dc.subject | Genetic algorithm | en_US |
| dc.title | Optimization of supply chains for single-vendor–multibuyer consignment stock policy with genetic algorithm | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | Mechanical Engineering | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| s00170-009-2286-2.pdf | 281.07 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.