Multi-population genetic algorithm to solve the synchronized and integrated two-level lot sizing and scheduling problem

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Algorítmo evolucionário para a distribuição de produtos de petróleo por redes de polidutos

The distribution of petroleum products through pipeline networks is an important problem that arises in production planning of refineries. It consists in determining what will be done in each production stage given a time horizon, concerning the distribution of products from source nodes to demand nodes, passing through intermediate nodes. Constraints concerning storage limits, delivering time, sources availability, limits on sending or receiving, among others, have to be satisfied. This problem can be viewed as a biobjective problem that aims at minimizing the time needed to for transporting the set of packages through the network and the successive transmission of different products in the same pipe is called fragmentation. This work are developed three algorithms that are applied to this problem: the first algorithm is discrete and is based on Particle Swarm Optimization (PSO), with local search procedures and path-relinking proposed as velocity operators, the second and the third algorithms deal of two versions based on the Non-dominated Sorting Genetic Algorithm II (NSGA-II). The proposed algorithms are compared to other approaches for the same problem, in terms of the solution quality and computational time spent, so that the efficiency of the developed methods can be evaluated

Proposta de avanço para o método Tambor-Pulmão-Corda Simplificado aplicado em ambientes de produção sob encomenda

Recentes aplicações da Teoria das Restrições em Gestão de Operações têm adotado o chamado método Tambor-Pulmão-Corda Simplificado (S-DBR - Simplified Drum-Buffer-Rope) como padrão para planejamento e controle da produção. Contudo, poucas são as referências bibliográficas, especialmente em periódicos nacionais e internacionais, que relatam seus principais conceitos e premissas. Este artigo se propõe a apresentar o método S-DBR para planejamento da produção e sua correspondente abordagem de controle da produção denominado Gerenciamento do Pulmão, aqui abordados em ambientes de produção sob encomenda (MTO - make to order), suas principais características, pressupostos e diferenças em relação ao método DBR clássico. É também apresentada uma proposta complementar ao método S-DBR para estabelecer promessas de entregas urgentes mantendo elevada probabilidade de entrega no prazo.

Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

A Lagrangian relaxation approach to a coupled lot-sizing and cutting stock problem

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Heuristics and meta-heuristics for lot sizing and scheduling in the soft drinks industry: A comparison study

This chapter studies a two-level production planning problem where, on each level, a lot sizing and scheduling problem with parallel machines, capacity constraints and sequence-dependent setup costs and times must be solved. The problem can be found in soft drink companies where the production process involves two interdependent levels with decisions concerning raw material storage and soft drink bottling. Models and solution approaches proposed so far are surveyed and conceptually compared. Two different approaches have been selected to perform a series of computational comparisons: an evolutionary technique comprising a genetic algorithm and its memetic version, and a decomposition and relaxation approach. © 2008 Springer-Verlag Berlin Heidelberg.

Reformulação para um problema integrado de dimensionamento e sequenciamento de lotes

In this paper, some new constraints and an extended formulation are presented for a Lot Sizing and Scheduling Model proposed in the literature. In the production process considered a key material is prepared and is transformed into different final items. The sequencing decisions are related to the order in which the materials are processed and the lot sizing decisions are related to the final items production. The mathematical formulation considers sequence-dependent setup costs and times. Results of the computational tests executed using the software Cplex 10.0 showed that the performance of the branch-and-cut method can be improved by the proposed a priori reformulation.

E-commerce environment and trade promotion for Latin America: policy implications from East Asian and advanced economies' experiences

Includes bibliography

Measuring supply chain management practices

Purpose: This paper aims to perform an empirical investigation about the constructs and indicators of the supply chain management practices framework. Design/methodology/approach: The measuring framework proposed is based on a survey that was carried out on 107 Brazilian companies. Statistical techniques were employed to verify, validate, and test the reliability of the constructs and their indicators. To validate this framework principal component analysis and structural equation modeling techniques were used. Findings: In general, previous studies suggest six constructs for measuring the supply chain management practices framework. However, in this study a framework was achieved with four constructs of supply chain management practices, namely, supply chain (SC) integration for production planning and control (PPC) support, information sharing about products and targeting strategies, strategic relationship with customer and supplier, and support customer order. This framework has adequate levels of validity and reliability. Research limitations/implications: The main limitation of this study was that only a small sample of companies in a single sector and country were surveyed, and therefore there needs to be further research considering the special conditions in other countries. Originality/value: This study investigated statistically set indicators to discuss the topic supply chain management practices. The framework obtained has good quality of validity and reliability indicators. Thus, an alternative framework has been added to measure supply chain management practices, which is currently a popular topic in the supply chain mainstream literature. Both defined constructs and the validated indicators can be used in other studies on supply chain management. © Emerald Group Publishing Limited.

Multi-choice mixed integer goal programming optimization for real problems in a sugar and ethanol milling company

Goal Programming (GP) is an important analytical approach devised to solve many realworld problems. The first GP model is known as Weighted Goal Programming (WGP). However, Multi-Choice Aspirations Level (MCAL) problems cannot be solved by current GP techniques. In this paper, we propose a Multi-Choice Mixed Integer Goal Programming model (MCMI-GP) for the aggregate production planning of a Brazilian sugar and ethanol milling company. The MC-MIGP model was based on traditional selection and process methods for the design of lots, representing the production system of sugar, alcohol, molasses and derivatives. The research covers decisions on the agricultural and cutting stages, sugarcane loading and transportation by suppliers and, especially, energy cogeneration decisions; that is, the choice of production process, including storage stages and distribution. The MCMIGP allows decision-makers to set multiple aspiration levels for their problems in which the more/higher, the better and the less/lower, the better in the aspiration levels are addressed. An application of the proposed model for real problems in a Brazilian sugar and ethanol mill was conducted; producing interesting results that are herein reported and commented upon. Also, it was made a comparison between MCMI GP and WGP models using these real cases. © 2013 Elsevier Inc.

Product mix: The approach of throughput per day

Defining product mix is very important for organisations because it determines how productive resources are allocated among various operations. However, it is often defined subjectively. The methods commonly used for this definition are Integer Linear Programming and heuristics based in Theory of Constraints, which use maximum throughput as a performance measure. Although this measure provides maximum throughput to specific problem, it does not consider aspects of time, as days, utilised to make the throughput. Taking this into account, the aim of this paper is to present a throughput per day approach to define product mix, as well as to propose a constructive heuristic to help in this process. The results show that the proposed heuristic obtained satisfactory approximation when compared to the optimum values obtained by enumeration. © 2013 Copyright Taylor and Francis Group, LLC.

Influência do mercado na adoção de tecnologias e viabilidade econômica da cultura do tomate de mesa, município de Bragança Paulista - SP

Pós-graduação em Agronomia (Energia na Agricultura) - FCA

Uma análise de jogos de empresas na área de planejamento da produção e uso integrado de sistemas de informações

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)