Show simple item record

dc.creatorOcampo Azocar, Horacio
dc.creatorSalazar Hornig, Eduardo
dc.date2014-07-31
dc.date.accessioned2019-04-17T22:07:57Z
dc.date.available2019-04-17T22:07:57Z
dc.identifierhttp://revistas.ubiobio.cl/index.php/RI/article/view/92
dc.identifier.urihttp://revistaschilenas.uchile.cl/handle/2250/49880
dc.descriptionEn este trabajo se desarrolla un procedimiento para resolver una extensión del problema clásico del lote económico y programación (ELSP), con múltiples productos y considerando tiempos de preparación dependientes de la secuencia (setup) y satisfacción atrasada de la demanda en un entorno productivo de una máquina. El procedimiento utiliza una heurística de la literatura para generar secuencias de lotes de producción, las que son evaluadas mediante un modelo de optimización no lineal desarrollado por los autores que incorpora la satisfacción de demanda atrasada (backlogging) y el cumplimiento de niveles de servicio, minimizando los costos de setup, de inventario y de atraso en un horizonte de tiempo. El método se ilustra mediante la resolución de un problema de tamaño reducido.This work develops a methodology to solve an extension of the Economic Lot Scheduling Problem (ELSP) satisfying the demand for multiple products considering sequence dependent setup times and backlogging in a single machine. The fundamental problem is to determine the production sequence and lot size for each production run, in order to meet customer demand in a given planning horizon, minimizing setup, inventory and backlogging costs. An incremental heuristic procedure that interchange two and three lots to obtain the lot production sequence is applied. These lot sequences are evaluated with a nonlinear optimization model to determine the lot size for each lot of the sequence. The method is illustrated solving a small instance of the problem.es-ES
dc.formatapplication/pdf
dc.languagespa
dc.publisherUniversidad del Bio-Bioes-ES
dc.relationhttp://revistas.ubiobio.cl/index.php/RI/article/view/92/3241
dc.relation/*ref*/BALLOU, R. Logística – Administración de la cadena de suministro. Pearson – Prentice Hall, México, 2004.
dc.relation/*ref*/BOMBERGER, E. A Dynamic Programming Approach to a Lot Scheduling Problem. Management Science, 1966,vol. 12, no. 11, p. 778 – 784.
dc.relation/*ref*/BRANDER, P. Inventory Control and Scheduling Problems in a Single-Machine Multi-Item System. Tesis de Doctorado.Suecia: Lulea University of Technology, 2005.
dc.relation/*ref*/DELPORTE, C., and THOMAS, L. Lot sizing and sequencing for N products on one facility, Management Science, 1978, vol. 23, no. 10, p. 1070 – 1079.
dc.relation/*ref*/DOBSON, G. The economic lot-scheduling problem: Achieving feasibility using time-varying lot sizes.Operations Research, 1987,vol. 35, no 5, p. 764 – 771.
dc.relation/*ref*/DOBSON, G. The cyclic lot scheduling problem with sequence-dependent setups. Operations Research, 1992, vol. 40, no. 4, p. 736 – 749.
dc.relation/*ref*/ELMAGHRABY, S. The Economic Lot Scheduling Problem (ELSP): Review and Extension. Management Science, 1978, vol. 24, no 6, p. 587 – 598.
dc.relation/*ref*/GALLEGO, G. and ROUNDY, R. The Economic Lot Scheduling Problem with Finite Backorder Costs. Naval Research Logistics, 1992, vol. 39, no.5, p. 729 – 739.
dc.relation/*ref*/GUPTA, D. On the economic lot scheduling problem with backlogging: The common cycle approach. Operations Research Letters, 1992, vol. 12, no. 2, p. 101 – 109.
dc.relation/*ref*/HANSMANN, F. Operations Research in Production and Inventory. John Wiley & Sons, 1962.
dc.relation/*ref*/HUANG, J.Y., and YAO, M.J. On the optimal lot-sizing and scheduling problem in serial-type supply chainsystem using a time-varying lot-sizing. International Journal of Production Research, 2013, vol. 51, no. 3,p. 735 – 750.
dc.relation/*ref*/JORDAN, C. Batching and Scheduling – Models and Methods for Several Problem Classes. Springer, 1996.
dc.relation/*ref*/OH, H.CH., and KARIMI, I.A. Planning production on a single processor with sequence-depend setup part 1: determination of campaigns. Computers and Chemical Engineering, 2001, vol. 25, no. 7 – 8, p. 1021 – 1030.
dc.relation/*ref*/KHOUJA, M., MICHALEWICZ, Z., and WILMOT, M. The use of genetic algorithm to solve the economic lot size scheduling problem. European Journal of Operational Research, 1998, vol. 110, no. 3, p. 509- 524.
dc.relation/*ref*/MALLYA, R. Multi-product scheduling on a single machine: a case study. Omega, 1992, vol. 20, no. 4, p. 529 – 534.
dc.relation/*ref*/MAXWELL, W. The scheduling of economic lot size. Naval Research Logistics Quarterly, 1964, vol. 11, no. 2,p. 89 – 124.
dc.relation/*ref*/MOON, E., SILVER, A., and CHOI, S. Hybrid genetic algorithm for the economic lot-scheduling problem. International Journal of Production Research, 2002, vol. 40, no. 4, p. 809 – 824.
dc.relation/*ref*/RAZA, A., AKGUNDUZ, A., and CHEN, M. A tabu search algorithm for solving economic lot scheduling problem. Journal of Heuristics, 2006, vol. 12, no. 6, p. 413 – 426.
dc.relation/*ref*/RAZA, A., and AKGUNDUZ, A.A comparative study of heuristic algorithm on Economic Lot Scheduling Problem. Computers & Industrial Engineering, 2008, vol. 55, no. 1, p. 94 – 109.
dc.relation/*ref*/SHIRODKAR, V., PILLAI, V., and SRIDHARAN, R. On the feasibility of sequence-dependent economic lot scheduling problem. International Journal of Production Research, 2011, vol. 49, no. 10,p. 2925 – 2939.
dc.relation/*ref*/WAGNER, B., and DAVIS, D. A search heuristic for the sequence-dependent economic lot scheduling problem. European Journal of Operational Research, 2002, vol. 141, no. 1, p. 133 – 146.
dc.rightsDerechos de autor 2014 Revista Ingeniería Industriales-ES
dc.sourceRevista Ingeniería Industrial; Vol. 13 Núm. 2 (2014)es-ES
dc.source0718-8307
dc.source0717-9103
dc.titleDimensionamiento de lotes y programación de una máquina para múltiples productos con setup y escasezes-ES
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion


This item appears in the following Collection(s)

Show simple item record