Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/12638Full 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:22:37Z | - |
| dc.date.available | 2015-11-24T17:22:37Z | - |
| dc.identifier.issn | 0305-0483 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/12638 | - |
| dc.rights | Default Licence | - |
| dc.subject | supply chain | en |
| dc.subject | newsvendor | en |
| dc.subject | optimal review period | en |
| dc.subject | stochastic demand | en |
| dc.subject | s policies | en |
| dc.subject | reorder point | en |
| dc.subject | systems | en |
| dc.subject | models | en |
| dc.subject | serial | en |
| dc.subject | costs | en |
| dc.title | Computing globally optimal (s,S,T) inventory policies | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.identifier.primary | DOI 10.1016/j.omega.2011.12.008 | - |
| heal.identifier.secondary | <Go to ISI>://000301614100016 | - |
| heal.identifier.secondary | http://ac.els-cdn.com/S0305048311001800/1-s2.0-S0305048311001800-main.pdf?_tid=8b924b7356542619914832079ba71a71&acdnat=1339055726_73336957881bfae6c54213ff6ed4245a | - |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικών | el |
| heal.publicationDate | 2012 | - |
| heal.abstract | We consider a single-echelon inventory installation under the (s,S,T) periodic review ordering policy. Demand is stationary random and, when unsatisfied, is backordered. Under a standard cost structure, we seek to minimize total average cost in all three policy variables; namely, the reorder level s, the order-up-to level S and the review interval T. Considering time to be continuous, we first model average total cost per unit time in terms of the decision variables. We then show that the problem can be decomposed into two simpler sub-problems; namely, the determination of locally optimal solutions in s and S (for any T) and the determination of the optimal T. We establish simple bounds and properties that allow solving both these sub-problems and propose a procedure that guarantees global optimum determination in all policy variables via finite search. Computational results reveal that the usual practice of not treating the review interval as a decision variable may carry severe cost penalties. Moreover, cost differences between (s,S,T) and other standard periodic review policies, including the simple base stock policy, are rather marginal (or even zero), when all policies are globally optimized. We provide a physical interpretation of this behavior and discuss its practical implications. (C) 2011 Elsevier Ltd. All rights reserved. | en |
| heal.publisher | Elsevier | en |
| heal.journalName | Omega-International Journal of Management Science | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά). ΜΑΘ | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Lagodimos-2012-Computing globally o.pdf | 521.69 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
