Combinação de abordagens GLSP e ATSP para o problema de dimensionamento e sequenciamento de lotes de produção de suplementos para nutrição animal

In this paper we study the combination of GLSP (General Lot Sizing and Scheduling Problem) and ATSP (Asymmetric Travelling Salesman Problem) approaches with sub-tour elimination and patching to a lot sizing and sequencing problem in the animal nutrition industry. This problem consists of deciding the lots size for each product as well the production sequence of the lots, while meeting demand without backlogs and minimizing production and inventory costs. The coordination of these decisions is a challenge for production scheduling in this industry as the setup times are sequence dependent. The ATSP approaches are compared with relax-and-fix approaches applied to the GLSP (General Lot-sizing and Scheduling Problem) formulated in previous research, using real data from an animal nutrition plant in Sao Paulo state. Portuguese: Neste artigo estudamos a combinação de abordagens GLSP (General Lot Sizing and Scheduling Problem) e ATSP (Asymmetric Travelling Salesman Problem) para o problema de dimensionamento e sequenciamento de lotes na indústria de nutrição animal. Este problema consiste em determinar o tamanho de cada lote de produção para cada produto, assim como a sequência de produção destes lotes, de forma a satisfazer a demanda sem atrasos e minimizar os custos de produção e estoques. Uma dificuldade para a programação da produção nesta indústria é integrar estas decisões, pois os tempos de preparação da linha de produção são dependentes da sequência produtiva e não obedecem a desigualdade triangular. A abordagem proposta é comparada com abordagens relax-and-fix para o modelo GLSP (General Lot-sizing and Scheduling Problem) estudadas em trabalhos anteriores, utilizando dados reais de um estudo de caso de uma fábrica de nutrição animal localizada no interior de São Paulo

A review of discrete-time optimization models for tactical production planning

This is an Accepted Manuscript of an article published in International Journal of Production Research on 27 Mar 2014, available online: http://doi.org/10.1080/00207543.2014.899721[EN] This study presents a review of optimization models for tactical production planning. The objective of this research is to identify streams and future research directions in this field based on the different classification criteria proposed. The major findings indicate that: (1) the most popular production-planning area is master production scheduling with a big-bucket time-type period; (2) most of the considered limited resources correspond to productive resources and, to a lesser extent, to inventory capacities; (3) the consideration of backlogs, set-up times, parallel machines, overtime capacities and network-type multisite configuration stand out in terms of extensions; (4) the most widely used modelling approach is linear/integer/mixed integer linear programming solved with exact algorithms, such as branch-and-bound, in commercial MIP solvers; (5) CPLEX, C and its variants and Lindo/Lingo are the most popular development tools among solvers, programming languages and modelling languages, respectively; (6) most works perform numerical experiments with random created instances, while a small number of works were validated by real-world data from industrial firms, of which the most popular are sawmills, wood and furniture, automobile and semiconductors and electronic devices.This study has been funded by the Universitat Politècnica de València projects: ‘Material Requirement Planning Fourth Generation (MRPIV)’ (Ref. PAID-05-12) and ‘Quantitative Models for the Design of Socially Responsible Supply Chains under Uncertainty Conditions. Application of Solution Strategies based on Hybrid Metaheuristics’ (PAID-06-12).Díaz-Madroñero Boluda, FM.; Mula, J.; Peidro Payá, D. (2014). A review of discrete-time optimization models for tactical production planning. International Journal of Production Research. 52(17):5171-5205. doi:10.1080/00207543.2014.899721S51715205521

A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines

This paper addresses the capacitated lot-sizing problem involving the production of multiple items on unrelated parallel machines. A production plan should be determined in order to meet the forecast demand for the items, without exceeding the capacity of the machines and minimize the sum of production, setup and inventory costs. A heuristic based on the Lagrangian relaxation of the capacity constraints and subgradient optimization is proposed. Initially, the heuristic is tested on instances of the single machine problem and results are compared with heuristics from the literature. For parallel machines and small problems the heuristic performance is tested against optimal solutions, and for larger problems it is compared with the lower bound provided by the Lagrangian relaxation. (c) 2005 Elsevier B.V. All rights reserved.17521070108

Construcción de algoritmo aplicando relajación lagrangeana para la obtención de un límite inferior para el problema de lotificación en sistemas multinivel en entornos de coproducción y listas de materiales alternativas /

En este trabajo se presenta un algoritmo para obtener una cota inferior para el problema de lotificación en sistemas multinivel en entornos de coproducción y listas de materiales alternativas basado en Relajación Lagrangeana. El problema estudiado es un problema de programación entera mixta el cual es semejante a la optimización de un MRP con listas de materiales alternativas, con múltiples recursos en entornos de coproducción y múltiples periodos de tiempo considerando restricciones de lead time y capacidad de producción y cae dentro de la categoría NP-HARD. Para la obtención de los multiplicadores de lagrange, que penalizan la función de objetivo, se utilizó el algoritmo de optimización del subgradiente. La implementación se realizó en el IDE de desarrollo GAMS. La calibración de los parámetros del algoritmo se realizó utilizando la metodología de superficie de respuesta. La validación del algoritmo propuesto se realiza por medio de un análisis comparativo aplicado en un caso real que trata de una empresa fabricante de partes en el sector del automóvil y un caso de demanda simulada tipo estacional y tendencia con los cinco tipos básicos de configuración de cadena de suministro o lista de materiales (BOM). Los resultados obtenidos comprueban que el algoritmo propuesto alcanza soluciones cercanas al óptimo en menor tiempo en comparación al modelo original, también denominado GMOP, resuelto bajo programación entera mixta (Branch and Bound o relajación lineal entera mixta). El desarrollo de este trabajo representa un aporte a la literatura debido a que no se encuentra aplicación de la Relajación Lagrangeana en problemas de lotificación en sistemas multinivel en entornos de coproducción y listas de materiales alternativas.Incluye referencias bibliográfica

A population-based metaheuristic for the capacitated lot-sizing problem with unrelated parallel machines

International audienceThis paper deals with the capacitated lot-sizing problem with multiple items, setup time and unrelated parallel machines. The aim of the article is to propose an efficient population-based metaheuristic to tackle this problem. In the proposed approach, a dynamic constructive heuristic is proposed for generating a set of initial solutions. A path-relinking strategy between solutions in the current population is integrated in the diversification procedure, allowing us to explore the solution space further. The population is then intensified using a local search procedure which uses an operator based on machine capacity relaxation coupled with a repair procedure. The proposed approach is evaluated from the instances introduced in Toledo, F. M. B., and V. A. Armentano (2006.“A Lagrangian-Based Heuristic for the Capacitated Lot-Sizing Problem in Parallel Machines.” European Journal of Operational Research 175 (2): 1070–1083). The results of the experiment show that the proposed approach yields competitive results in terms of solution quality for most of the instances

Tabu Search With Path Relinking For An Integrated Productiondistribution Problem

This paper deals with the problem of integrating production and distribution planning over periods of a finite horizon. We consider a capacity-constrained plant that produces a number of items distributed by a fleet of homogenous vehicles to customers with known demand for each item in each period. The production planning defines the amount of each item produced in every period, while the distribution planning defines when customers should be visited, the amount of each item that should be delivered to customers, and the vehicle routes. The objective is to minimize production and inventory costs at the plant, inventory costs at the customers and distribution costs. We propose two tabu search variants for this problem, one that involves construction and a short-term memory, and one that incorporates a longer term memory used to integrate a path relinking procedure to the first variant. The proposed tabu search variants are tested on generated instances with up to ten items and on instances from the literature involving a single item. © 2010 Elsevier Ltd.38811991209Simchi-Levi, D., Kaminskt, P., Simchi-Levi, E., (2004) Managing the Supply Chain, , McGraw-Hill New YorkShiguemoto, A.L., (2008) Métodos Heurísticos Para Resolução de Problemas Integrados de Produção, Estoque e Distribuiç ão, , Doctoral thesis (in portuguese), Universidade Estadual de Campinas, SP, BrazilThomas, J.D., Griffin, P.M., Coordinated supply chain management (1996) European Journal of Operational Research, 94, pp. 1-15Vidal, C.J., Goetschalckx, M., Strategic productiondistribution models: A critical review with emphasis on global supply chain models (1997) European Journal of Operational Research, 98, pp. 1-18Sarmiento, A.M., Nagi, R., A review of integrated analysis of productiondistribution (1999) IIE Transactions, 31, pp. 1061-1074Ereng, S.S., Simpson, N.C., Vakharia, A.J., Integrated production/distribution planning in supply chains: An invited review (1999) European Journal of Operational Research, 115, pp. 219-236Chen, Z.-L., Integrated Production and Distribution Operations: Taxonomy, Models, and Review (2004) Handbook of Quantitative Supply Chain Analysis: Modelling in the E-Business Era, pp. 711-746Hurter, A.P., Van Buer, M.G., The newspaper production/distribution problem (1996) Journal of Business Logistics, 17, pp. 85-107Van Buer, M.G., Woodruff, D.L., Olson, R.T., Solving the medium newspaper production/distribution problem (1999) European Journal of Operational Research, 115, pp. 237-253Russell, R., Chiang, W.-C., Zepeda, D., Integrating multi-product production and distribution in newspaper logistics (2008) Computers and Operations Research, 35, pp. 1576-1588Chandra, P., Fisher, M.L., Coordination of production and distribution planning (1994) European Journal of Operational Research, 72, pp. 503-517Fumero, F., Vercellis, C., Synchronized development of production, inventory, and distribution schedules (1999) Transportation Science, 33, pp. 330-340Boudia, M., Louly, M.A.O., Prins, C., A reactive GRASP and path relinking for a combined production- distribution problem (2007) Computers and Operations Research, 34 (11), pp. 3402-3419. , DOI 10.1016/j.cor.2006.02.005, PII S0305054806000426Boudia, M., Prins, C., A memetic algorithm with dynamic population management for an integrated productiondistribution problem (2009) European Journal of Operational Research, 195, pp. 703-715Bard, J.F., Nananukul, N., The integrated production-inventory-distribution-routing problem (2009) Journal of Scheduling, 12, pp. 257-280Lei, L., Liu, S., Ruszczynski, A., Park, S., On the integrated production, inventory, and distribution routing problem (2006) IIE Transactions, 38, pp. 955-970Toth, P., Vigo, D., (2002) The Vehicle Routing Problem, , SIAM PhiladelphiaKarimi, B., Fatemi, S.M.T., Wilson, J.M., The capacitated lot sizing problem: A review of models and algorithms (2003) Omega, 31, pp. 365-378Glover, F., Laguna, M., (1997) Tabu Search, , Boston, MA KluwerGendreau, M., (2004) On the Importance of Allowing Infeasible Moves in Tabu Search Heuristics, Presented at the INFORMS National Meeting, , Denver, OctoberClarke, G., Wright, J.W., Scheduling of vehicles from a central depot to a number of delivery points (1964) Operations Research, 12, pp. 568-581Evans, J.R., An efficient implementation of the WagnerWhitin algorithm for dynamic lot-sizing (1985) Journal of Operational Management, 5, pp. 229-235Wagner, H.M., Whitin, T.M., Dynamic version of the economic lot size model (1958) Management Science, 5, pp. 89-96Glover, F., Tabu Search and Adaptive Memory ProgrammingAdvances, Applications and Challenges (1996) Computing Tools for Modeling. Optimization and Simulation: Interfaces in Computer Science and Operations Research, pp. 1-75Glover, F., A Template for Scatter Search and Path Relinking (1998) Artificial Evolution Lecture Notes in Computer Science, 1363, pp. 13-54Mart, R., Laguna, M., Glover, F., Principles of scatter search (2006) European Journal of Operational Research, 169, pp. 359-372Yamashita, D.S., Armentano, V.A., Laguna, M., Scatter search for project scheduling with resource availability cost (2006) European Journal of Operational Research, 169, pp. 623-637Resende, M.G.C., Ribeiro, C.C., Glover, F., Mart, R., Scatter search and path-relinking: Fundamentals, advances, and applications (2010) Handbook of MetaheuristicsBertazzi, L., Paletta, G., Speranza, M.G., Minimizing the total cost in an integrated vendor-managed inventory ystem (2005) Journal of Heuristics, 11, pp. 393-419Trigeiro, W.W., Thomas, L.J., McClain, J.O., Capacitated lot sizing with setup times (1989) Management Science, 35, pp. 353-366Toledo, F.M.B., Armentano, V.A., A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines (2006) European Journal of Operational Research, 175, pp. 1070-108