Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/13293Full 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:58Z | - |
| dc.date.available | 2015-11-24T17:26:58Z | - |
| dc.identifier.issn | 0305-0548 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/13293 | - |
| dc.rights | Default Licence | - |
| dc.subject | supply chain | en |
| dc.subject | periodic | en |
| dc.subject | newsvendor | en |
| dc.subject | optimal review period | en |
| dc.subject | stochastic demand | en |
| dc.subject | stochastic inventory systems | en |
| dc.subject | policies | en |
| dc.subject | models | en |
| dc.title | Optimal (r,nQ,T) batch ordering with quantized supplies | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.identifier.primary | DOI 10.1016/j.cor.2011.03.016 | - |
| heal.identifier.secondary | <Go to ISI>://000295541000012 | - |
| heal.identifier.secondary | http://ac.els-cdn.com/S030505481100092X/1-s2.0-S030505481100092X-main.pdf?_tid=ef77efdbaefae1128a02cd9ddb17eb9f&acdnat=1339055699_c6d2860ebc851e08d1e2ccee82729df1 | - |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικών | el |
| heal.publicationDate | 2012 | - |
| heal.abstract | We consider the control of a single-echelon inventory installation under the (r,nQ,T) batch ordering policy. Demand follows a stationary stochastic process and, when unsatisfied, is backordered. The supply process is quantized; so the policy base batch Q needs to satisfy the constraint Q=kg, where k is an integer and q an exogenous fixed supply lot, often reflecting physical supply limitations. Assuming continuous time and a standard cost structure, we determine the (r,nQ,T) policy variables that minimize total average cost per unit time subject to the supply lot constraint. While total average cost is not convex, we show that average holding and backorders costs are jointly convex in all policy variables. This helps establish optimality properties and convex bounds that allow developing an algorithm to exactly solve the quantized supplies optimization problem. Computations reveal that, depending on the supply lot size, quantized supplies may cause serious cost increase. (C) 2011 Elsevier Ltd. All rights reserved. | en |
| heal.publisher | Elsevier | en |
| heal.journalName | Computers & Operations Research | 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) bat.pdf | 442.48 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
