| Autor: |
Sergio Gerardo De los Cobos Silva, Miguel Ángel Gutiérrez Andrade, John Goddard Close, Blanca Rosa Pérez Salvador |
| Jazyk: |
English<br />Spanish; Castilian |
| Rok vydání: |
2009 |
| Předmět: |
|
| Zdroj: |
Revista de Matemática: Teoría y Aplicaciones, Vol 13, Iss 2, Pp 117-124 (2009) |
| Druh dokumentu: |
article |
| ISSN: |
2215-3373 |
| DOI: |
10.15517/rmta.v13i2.272 |
| Popis: |
In this paper an introduction is given to a multiple-item inventory problem, known as the Joint Replenishment Problem (JRP). This is a real world problem which has been extensively studied. The JRP has a continuous decision variable, and as many discrete decision variables as products that are ordered and produced. An exact method, given by Goyal, exists for solving the JRP, however for a large number of discrete decision variables the computational time required becomes prohibitive. Here, an alternative characterization of the solution for the combinatorial part of the JRP is given. Keywords: Inventory mutiple-item problems, joint replenishment problem. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
