Discrete lot sizing and scheduling on parallel machines: description of a column generation approach

In this work, we study the discrete lot sizing and scheduling problem (DSLP) in identical parallel resources with (sequence-independent) setup costs and inventory holding costs. We propose a Dantzig-Wolfe decomposition of a known formulation and describe a branch-and-price and column generation procedure to solve the problem to optimality. Preliminary results show that the lower bounds provided by the reformulated model are stronger than the lower bounds provided by the linear programming relaxation of the original model

A column generation approach to the discrete lot sizing and scheduling problem on parallel machines

In this work, we study the discrete lot sizing and scheduling problem (DSLP) in identical parallel resources with (sequence-independent) setup costs and inventory holding costs. We propose a Dantzig-Wolfe decomposition of a known formulation and describe a branch-and-price and column generation procedure to solve the problem to optimality. The results show that the lower bounds provided by the reformulated model are stronger than the lower bounds provided by the linear programming (LP) relaxation of the original model.info:eu-repo/semantics/publishedVersio

Parallel machine scheduling using free software: an application

We will show how to implement large scale optimization by only using freely available software tools. We solve exactly a parallel machine scheduling problem with identical parallel machines and malleable tasks, subject to arbitrary release dates and due dates. The objective is to minimize a function of late work and setup costs. We use the COIN-OR BCP framework to implement column generation to solve a model that results from a Dantzig-Wolfe decomposition, and also CRIFOR MCFZIB to solve an equivalent network flow model. Computational results are presented

Solving a multiprocessor problem by column generation and branch-and-price

This work presents an algorithm for solving exactly a scheduling problem with identical parallel machines and malleable tasks, subject to arbitrary release dates and due dates. The objective is to minimize a function of late work and setup costs. A task is malleable if we can freely change the set of machines assigned to its processing over the time horizon. We present an integer programming model, a Dantzig-Wolfe decomposition reformulation and its solution by column generation. We also developed an equivalent network flow model, used for the branching phase. Finally, we carried out extensive computational tests to verify the algorithm’s efficiency and to determine the model’s sensitivity to instance size parameters: the number of machines, the number of tasks and the size of the planning horizon

Seismic hazard in Nicaragua: a case study of Managua

Nicaragua, país centroamericano de 6.2 millones de habitantes, conocido por sus grandes lagos y volcanes activos, se encuentra en el cinturón de fuego del Pacífico, en la zona de subducción de la Placa Coco bajo la Placa Caribe. El país tiene un amplio historial de destrucción causado por sucesivos terremotos de fuerte magnitud. Centenas de fallas geológicas causan sismos frecuentes en la capital, Managua. El propósito de este trabajo es analizar el caso singular de Managua y su alto riesgo de sufrir pérdidas y daños por desastres naturales catastróficos, presentando para eso, el escenario tectónico-volcánico del país; el estudio se enfoca en los episodios más extremos ocurridos, analizando la amenaza sísmica en Managua. Como resultado de este trabajo se entrega un panorama general de los tipos de amenazas geológicas que desafían Nicaragua, concentrándose en las amenazas sísmicas y algunos episodios trágicos en el historial de desastres naturales geológicos, contribuyendo así con la difusión de conocimientos necesarios al planteamiento de políticas de mitigación y prevención de desastres geológicos sísmicos y volcánicos.Nicaragua, Central American country of 6.2 million people, is known for its large lakes and active volcanoes. Yet, the country has a long history of destruction caused by successive strong earthquakes, due to its location on the Pacific Ring of Fire in the subduction zone of the Cocos plate under the Caribbean plate. As such, Managua, the capitol, with 1.480.000 million inhabitants, is the most susceptible area to disasters, as a result of hundreds of faults that cause frequent earthquakes. The purpose of this paper is to analyze the risks that the city of Managua faces of suffering material and human losses, in the event of an extreme natural disaster, by describing the tectonic-volcanic conditions of the country, taking as theoretical reference the concepts of natural hazards and natural disasters. The empirical section analyzes data from Nicaraguan scientific institutes and specialized literature, from which an overview of the types of geological hazards that prevail in the country is laid out. By focusing on seismic hazards and on some tragic episodes in the history of geological disasters,the paper aims to contribute to the current body of knowledge necessary for the definition of mitigation and prevention policies of seismic and volcanic geological disasters

Selection of native trees for intercropping with coffee in the Atlantic Rainforest biome

A challenge in establishing agroforestry systems is ensuring that farmers are interested in the tree species, and are aware of how to adequately manage these species. This challenge was tackled in the Atlantic Rainforest biome (Brazil), where a participatory trial with agroforestry coffee systems was carried out, followed by a participatory systematisation of the farmers experiences. Our objective was to identify the main tree species used by farmers as well as their criteria for selecting or rejecting tree species. Furthermore, we aimed to present a specific inventory of trees of the Leguminosae family. In order to collect the data, we reviewed the bibliography of the participatory trial, visited and interviewed the farmers and organised workshops with them. The main farmers' criteria for selecting tree species were compatibility with coffee, amount of biomass, production and the labour needed for tree management. The farmers listed 85 tree species; we recorded 28 tree species of the Leguminosae family. Most trees were either native to the biome or exotic fruit trees. In order to design and manage complex agroforestry systems, family farmers need sufficient knowledge and autonomy, which can be reinforced when a participatory methodology is used for developing on-farm agroforestry systems. In the case presented, the farmers learned how to manage, reclaim and conserve their land. The diversification of production, especially with fruit, contributes to food security and to a low cost/benefit ratio of agroforestry systems. The investigated agroforestry systems showed potential to restore the degraded landscape of the Atlantic Rainforest biome

Modelos de planeamento de tricotagem - estudo de um caso

Este trabalho é dedicado ao estudo e desenvolvimento de algoritmos para o planeamento da tricotagem de uma empresa multinacional do ramo têxtil, que se dedica à produção de artigos de malha fina. Esta empresa contém quatro secções produtivas, que se encontram divididas da seguinte forma: tricotagem, montagem, tinturaria e acabamento. O trabalho que aqui se apresenta está relacionado com a secção de tricotagem, a qual se encontra ainda dividida em três subsecções. Embora nesta secção sejam produzidos todos os componentes principais de um artigo final, nesta fase do trabalho apenas se considera a subsecção em>cotton, onde são produzidas as partes de corpos do artigo final. A principal razão pela qual se iniciou por esta subsecção está relacionada com o facto de esta ter capacidades muito apertadas, requerendo um planeamento rigoroso e eficiente. Com este trabalho pretende-se resolver de uma forma integrada dois problemas da secção de tricotagem cotton: (1) o de dimensionamento de lotes e (2) o de sequenciamento desses lotes em vários conjuntos de máquinas. Numa solução para o problema as quantidades totais a produzir por artigo/componente/tamanho são divididas em vários lotes de menor dimensão, faz-se a afectação desses lotes às máquinas e determina-se a ordem (sequência) segundo a qual estes devem ser produzidos. Cada lote pode ser produzido de forma independente em qualquer altura, num (sub)conjunto de máquinas adequadas à sua produção. Este problema caracteriza-se pela existência de: vários conjuntos de máquinas paralelas idênticas; procuras arbitrárias e datas de entrega associadas a artigos finais; uma matriz de compatibilidade entre máquinas e artigos/componentes/tamanhos; datas de disponibilidade de máquinas; tempos de preparação dependentes da sequência e tempos de produção unitários. Os objectivos a atingir são: (1) a minimização do atraso total e (2) a minimização do desvio entre os instantes de conclusão dos vários componentes que pertencem ao mesmo artigo. Propõe-se um modelo de programação inteira mista para este problema, que considera todos os aspectos acima referidos. Dada a dimensão e complexidade do modelo não se obtêm facilmente soluções exactas para o mesmo. Assim, propõe-se uma heurística que consiste na resolução iterativa de problemas de fluxo de custo mínimo e no sequenciamento de diferentes conjuntos de componentes

Heuristic approaches for lot splitting and scheduling in identical parallel machines

In this paper we address a practical lot splitting and scheduling problem of a textile company that produces fine knitted garments. The problem consists of finding a weekly production plan for the knitting section, in which the garment components are produced in a set of parallel machines. We solve the problem in two steps using heuristic approaches. In the first step one of two heuristics (a network flow heuristic and a constructive heuristic) is applied to find an initial solution and in the second step local search based algorithms are applied to improve the quality of the solutions.This work was supported by the Portuguese Science and Technology Foundation through the doctoral Grant SFRH / BD / 38582 / 2007 for Carina Pimentel

A fast heuristic for a lot splitting and scheduling problem of a textile industry

In this paper we address a lot splitting and scheduling problem of a Textile factory that produces garment pieces. Each garment piece is made of a set of components that are produced on the knitting section of the company. The problem consists of finding a weekly production plan for the knitting section, establishing the quantities to produce of each component (organized in one or several lots), and where and when starting/completion times) to produce them. The main contribution of this work is the development of a constructive heuristic that generates automated knitting scheduling plans. The heuristic produces solutions very fast for a set of randomly generated instances based on real world data

Heuristic approaches for a practical lot splitting and scheduling problem

In this talk we present some heuristic approaches for a real world lot splitting and scheduling problem of a Textile factory. The problem consists of finding a weekly production plan for the knitting section of the company, establishing the quantities to produce of each component (organized in one or several lots), and where and when (starting/completion times) to produce them. Two important objectives to achieve are on time delivery of products and minimum levels of work-in-process inventory. We present some results for a set of randomly generated instances based on real world data