Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/13292Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Lagodimos, A. G. | en |
| dc.contributor.author | Christou, I. T. | en |
| dc.contributor.author | Skouri, K. | en |
| dc.date.accessioned | 2015-11-24T17:26:57Z | - |
| dc.date.available | 2015-11-24T17:26:57Z | - |
| dc.identifier.issn | 0020-7721 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/13292 | - |
| dc.rights | Default Licence | - |
| dc.subject | supply chain | en |
| dc.subject | periodic | en |
| dc.subject | newsvendor | en |
| dc.subject | optimisation | en |
| dc.subject | stochastic demand | en |
| dc.subject | inventory policies | en |
| dc.subject | service-levels | en |
| dc.subject | models | en |
| dc.subject | systems | en |
| dc.title | Optimal (r, nQ, T) batch-ordering policy under stationary demand | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.identifier.primary | Doi 10.1080/00207721.2011.555010 | - |
| heal.identifier.secondary | <Go to ISI>://000306409300018 | - |
| heal.identifier.secondary | http://www.tandfonline.com/doi/pdf/10.1080/00207721.2011.555010 | - |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικών | el |
| heal.publicationDate | 2012 | - |
| heal.abstract | We consider the control of a single-echelon inventory system under the standard (r, nQ, T) batch-ordering policy. Demand follows a stationary stochastic process and, when unsatisfied, is backordered. Under a standard cost structure, we seek to minimise total average cost per unit time. In contrast to previous research, all three policy variables (i.e. reorder level r, batch size Q and review interval T) are simultaneously optimised. While average total cost is not convex, analytic properties for two new cost bounds and a Newsboy characterisation of the optimal solution lead to an exact search algorithm with guaranteed convergence to the global optimum. Computational results demonstrate that the inclusion of the review interval as a decision variable in the optimisation problem can offer substantial cost savings. | en |
| heal.publisher | Taylor & Francis | en |
| heal.journalName | International Journal of Systems Science | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά). ΜΑΘ | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Lagodimos-2012-Optimal (r, nQ, T) b.pdf | 314 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
