Computing Replenishment Cycle Policy Parameters for a Perishable Item*
| dc.contributor.author | Rossi R. | |
| dc.contributor.author | Tarim S.A. | |
| dc.contributor.author | Hnich B. | |
| dc.contributor.author | Prestwich S.D. | |
| dc.date.accessioned | 2023-06-16T15:06:33Z | |
| dc.date.available | 2023-06-16T15:06:33Z | |
| dc.date.issued | 2010 | |
| dc.description | 24th Mini EURO Conference on Continuous Optimization and Information-Based Technologies in the Financial Sector, MEC EurOPT 2010 -- 23 June 2010 through 26 June 2010 -- Izmir -- 106702 | en_US |
| dc.description.abstract | In many industrial environments there is a significant class of problems for which the perishable nature of the inventory cannot be ignored in developing replenishment order plans. Food is the most salient example of a perishable inventory item. In this work, we consider the periodic-review, single-location, single-product production/inventory control problem under non-stationary stochastic demand and service level constraints. The product we consider can be held in stock for a limited amount of time after which it expires and it must be disposed of at a cost. In addition to wastage costs, our cost structure comprises fixed and unit variable ordering costs, and inventory holding costs. We propose an easy-to-implement replenishment cycle inventory control policy that yields at most 2N control parameters, where N is the number of periods in our planning horizon. We also show, on a simple numerical example, the improvement brought by this policy over two other simpler inventory control rules of common use. © Izmir University of Economics, Turkey, 2010. | en_US |
| dc.identifier.isbn | 9.79E+12 | |
| dc.identifier.scopus | 2-s2.0-84884312629 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.14365/3979 | |
| dc.language.iso | en | en_US |
| dc.publisher | Vilnius Gediminas Technical University | en_US |
| dc.relation.ispartof | 24th Mini EURO Conference on Continuous Optimization and Information-Based Technologies in the Financial Sector, MEC EurOPT 2010 | en_US |
| dc.rights | info:eu-repo/semantics/closedAccess | en_US |
| dc.subject | Inventory management | en_US |
| dc.subject | Optimization | en_US |
| dc.subject | Perishability | en_US |
| dc.subject | Uncertainty and risk | en_US |
| dc.subject | Inventory control | en_US |
| dc.subject | Optimization | en_US |
| dc.subject | Industrial environments | en_US |
| dc.subject | Inventory control policies | en_US |
| dc.subject | Inventory management | en_US |
| dc.subject | Perishability | en_US |
| dc.subject | Perishable inventory | en_US |
| dc.subject | Production/inventory control | en_US |
| dc.subject | Service level constraint | en_US |
| dc.subject | Uncertainty and risks | en_US |
| dc.subject | Costs | en_US |
| dc.title | Computing Replenishment Cycle Policy Parameters for a Perishable Item* | en_US |
| dc.type | Conference Object | en_US |
| dspace.entity.type | Publication | |
| gdc.author.scopusid | 35563636800 | |
| gdc.author.scopusid | 6602458958 | |
| gdc.author.scopusid | 7004234709 | |
| gdc.coar.access | metadata only access | |
| gdc.coar.type | text::conference output | |
| gdc.description.departmenttemp | Rossi, R., Logistics, Decision and Information Sciences, Wageningen UR, Netherlands; Tarim, S.A., Department of Management, Hacettepe University, Ankara, Turkey; Hnich, B., Department of Computer Science, Izmir University of Economics, Turkey; Prestwich, S.D., Department of Computer Science, University College, Cork, Ireland | en_US |
| gdc.description.endpage | 247 | en_US |
| gdc.description.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
| gdc.description.scopusquality | N/A | |
| gdc.description.startpage | 241 | en_US |
| gdc.description.wosquality | N/A | |
| gdc.index.type | Scopus | |
| gdc.scopus.citedcount | 3 | |
| relation.isOrgUnitOfPublication | e9e77e3e-bc94-40a7-9b24-b807b2cd0319 | |
| relation.isOrgUnitOfPublication.latestForDiscovery | e9e77e3e-bc94-40a7-9b24-b807b2cd0319 |
Files
Original bundle
1 - 1 of 1
