Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/20.500.12008/3451

Título:

An algorithm for the serial capacitated economic lot-sizing problem with non-speculative costs and stationary capacities

Otros títulos:

Coordinador:

Director:

Compilador:

Autor:

Piñeyro, Pedro
Viera, Omar
Cancela, Héctor

Tutor:

Tipo de documento:

Reporte técnico

Editor:

Palabras clave:

Capacitated Economic Lot-Sizing Problem
Inventory Control

Descriptores:

Año de publicación:

2010

Contenido:

Resumen:

We address the serial capacitated economic lot-sizing problem under particular assumptions on the costs and the capacity pattern. We prove that when the involved costs are non-speculative with respect to the transfer to future periods and the capacity pattern is stationary for all levels, the optimal plan for each level can be obtained independently in O(T 3) time. This leads to an O(T 3L) algorithm for the problem with L levels. and the capacity pattern is stationary for all levels, the optimal plan for each level can be obtained independently in O(T 3) time. This leads to an O(T 3L) algorithm for the problem with L levels.

Descripción:

Editorial:

UR. FI – INCO.

EN:

Reportes Técnicos 10-10

Financiadores:

Citación:

PIÑEYRO, P., VIERA, O., CANCELA BOSI, H. "An algorithm for the serial capacitated economic lot-sizing problem with non-speculative costs and stationary capacities". Reportes Técnicos 10-10. UR. FI – INCO, 2010.

Citación:

metadata.cc.license.name:

Documento del Gobiberno:

URI:

http://hdl.handle.net/20.500.12008/3451

ISBN:

e-ISBN:

ISSN:

0797-6410

ISMN:

Otros identificadores:

Título Obtenido:

Facultad o Servicio que otorga el Título:

Licencia:

Licencia Creative Commons Atribución – No Comercial – Sin Derivadas (CC BY-NC-ND 4.0)

Cobertura geográfica:

Cobertura temporal:

metadata.dc.relation.IsVersionOf:

Clasificación:

Es versión de:

Colecciones:

FicherosDescripciónTamañoFormato
TR1010.pdf — 213.05 KB Adobe PDF