Search

With the simulation and optimization of a manufacturing system, the input parameters are sought to obtain the best performance of the system, considering in many cases a single objective or measure of performance. However, many decisions involve multiple criteria, usually in conflict. Currently, companies are required to improve their profitability as well as to reduce their impact on the environment and use energy rationally. In this paper, the wood products manufacturing process of a small company was studied to determine redesign alternatives, with simultaneous economic and environmental criteria. A simulation model of the system was built, which was validated and verified, and an optimization model for it in which two objectives were combined in a single function, incorporating in it the preferences of the decision makers with respect to each criterion. Results expose that combining both criteria it is possible to achieve substantial improvements in the benefit, at the same time that generating less emissions than if only the economic objective were pursued. It is concluded that simulation and optimization combining both criteria can improve economic-environmental performance in wood manufacturing systems, even in small companies. [ABSTRACT FROM AUTHOR]

When we face an optimization problem whose de finition (in some aspect) changes over the time, we are in the presence of a Dynamic Optimization Problem (DOP). The aspects that can change are the objective function, the variables' domain, the appearance/disappearance of variables or constraints, etc. This paper aims at providing a first introduction to those who are interested in the topic. Concretely, we present the DOPs, the most common performance measures as well as the methods used to solve them. We also briefly describe some of the most recent reviews and comment some current challenges and research opportunities in DOPs. [ABSTRACT FROM AUTHOR]

This paper studied the permutation flowshop with sequence dependent setup times and makespan minimization. An ant colony algorithm which turns the original problem into an asymmetric TSP (Traveling Salesman Problem) structure is presented, and applied to problems proposed in the literature and is compared with an adaptation of the NEH heuristic. Subsequently a neighborhood search was applied to the solution obtained by the ACO algorithm and the NEH heuristic. [ABSTRACT FROM AUTHOR]