dc.creator | Gutiérrez, J. | |
dc.creator | Puerto Albandoz, Justo | |
dc.creator | Sicilia Rodríguez, Joaquín | |
dc.date.accessioned | 2015-06-23T13:56:36Z | |
dc.date.available | 2015-06-23T13:56:36Z | |
dc.date.issued | 2004 | |
dc.identifier.citation | Gutiérrez, J., Puerto Albandoz, J. y Sicilia, J. (2004). The multiscenario lot size problem with concave costs. European Journal of Operational Research, 156 (1), 162-182. | |
dc.identifier.issn | 0377-2217 | |
dc.identifier.other | http://grupo.us.es/gpb97/curri_sevilla/doc/ZIO_EJOR.PDF | |
dc.identifier.uri | http://hdl.handle.net/11441/26035 | |
dc.description.abstract | The dynamic single-facility single-item lot size problem is addressed. The finite planning horizon is divided into several time periods. Although the total demand is assumed to be a 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. Moreover, we assume that the production/reorder and holding cost vectors can vary from one scenario to another. For each scenario, we consider as the objective function the sum of the production/reorder and the holding costs. The problem consists of determining all the Pareto-optimal or non-dominated production plans with respect to all scenarios. We propose a solution method based on a multiobjective branch and bound approach. Depending on whether shortages are considered or not, different upper bound sets are provided. Computational results on several randomly generated problems are reported. | |
dc.format | application/pdf | |
dc.language.iso | eng | |
dc.publisher | Elsevier | |
dc.relation.ispartof | European Journal of Operational Research, 156 (1), 162-182. | |
dc.rights | Atribución-NoComercial-SinDerivadas 4.0 España | |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0 | |
dc.subject | Scenarios | |
dc.subject | Inventory | |
dc.subject | Multiple objective programming | |
dc.title | The multiscenario lot size problem with concave costs | |
dc.type | info:eu-repo/semantics/article | |
dcterms.identifier | https://ror.org/03yxnpp24 | |
dc.type.version | info:eu-repo/semantics/submittedVersion | |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | |
dc.contributor.affiliation | Universidad de Sevilla. Departamento de Estadística e Investigación Operativa | |
dc.relation.publisherversion | 10.1016/S0377-2217(03)00014-6 | |
dc.relation.publisherversion | https://www.sciencedirect.com/science/article/pii/S0377221703000146 | |
dc.identifier.doi | 10.1016/S0377-2217(03)00014-6 | es |
dc.journaltitle | European Journal of Operational Research | |
dc.publication.volumen | 156 | |
dc.publication.issue | 1 | |
dc.publication.initialPage | 162 | |
dc.publication.endPage | 182 | |
dc.identifier.idus | https://idus.us.es/xmlui/handle/11441/26035 | |