haku: @indexterm COMBINATORIAL OPTIMIZATION / yhteensä: 13
viite: 3 / 13
| Tekijä: | Gutierrez, J. Puerto, J. Sicilia, J. |
| Otsikko: | The multiscenario lot size problem with concave costs |
| Lehti: | European Journal of Operational Research
2004 : JUL, VOL. 156:1, p. 162-182 |
| Asiasana: | Scenarios Inventory control Multiobjective programming Lot-size model Branch and bound methods Combinatorial optimization |
| Kieli: | eng |
| Tiivistelmä: | The paper addresses the dynamic single-facility single-item lot size problem. The finite planning horizon is divided into several time periods. Altough the total demand is assumed to be fixed value, the distribution of this demand among the different periods is unknown. Therefore, for each period the demand can be chosen from a discrete set of values. For this reason, all the combinations of the demand vector yield a set of different scenarios. The problem consists of determining all the Pareto-optimal or non-dominated production plans with respect to all scenarios. The authors propose a solution method based on a multiobjective branch and bound approach. Throughout the paper, the case with concave costs is discussed. Computational results on several randomly generated problems are reported. The problem introduced in this paper fits into the multiobjective combinatorial optimization (MOCO). MOCO problems are an emergent area of research in many fields of operational research. |
SCIMA