Abstract
In this paper a new heuristic is proposed to solve general multi-level lot-sizing and scheduling problems. The idea is to cross-fertilize the principles of the meta-heuristic Variable Neighborhood Decomposition Search (VNDS) with those of the MIP-based Fix&Optimize heuristic. This combination will make it possible to solve the kind of problems that typically arise in the consumer goods industry due to sequence-dependent setups and shifting bottlenecks. In order to demonstrate the strength of this procedure, a GLSP variant for multiple production stages is chosen as a representative. With the help of artificial and real-world instances, the quality of the solution as well as the computational performance of the new procedure is tested and compared to a standard MIP-solver.

Abstract
In this work we present single-stage formulations for the integrated soft drink lot-sizing and scheduling problem with two-stage synchronization. It is a multi-product, multi-machine problem, with sequence-dependent setup times and costs. Without loss of generality, these single-stage reformulations address the problem correctly and, in general, reduce the size of the synchronized two-stage model of Ferreira, Morabito e Rangel (2009), regarding the number of variables and constraints. The preliminary computational experiments on real-world instances from a soft-drink company show the competitiveness of the single-stage models against other formulations and solution approaches reported in the literature.

Abstract
Driven by a real-world application in the capital-intensive glass container industry, this paper provides the design of a new hybrid evolutionary algorithm to tackle the short-term production planning and scheduling problem. The challenge consists of sizing and scheduling the lots in the most cost-effective manner on a set of parallel molding machines that are fed by a furnace that melts the glass. The solution procedure combines a multi-population hierarchically structured genetic algorithm (GA) with a simulated annealing (SA), and a tailor-made heuristic named cavity heuristic (CH). The SA is applied to intensify the search for solutions in the neighborhood of the best individuals found by the GA, while the CH determines quickly values for a relevant decision variable of the problem: the processing speed of each machine. The results indicate the superior performance of the proposed approach against a state-of-the-art commercial solver, and compared to a non-hybridized multi-population GA.

Abstract

Abstract
Forest fires are a serious management challenge in many regions, complicating the appropriate allocation to suppression and prevention efforts. Using a System Dynamics (SD) model, this paper explores how interactions between physical and political systems in forest fire management impact the effectiveness of different allocations. A core issue is that apparently sound management can have unintended consequences. An instinctive management response to periods of worsening fire severity is to increase fire suppression capacity, an approach with immediate appeal as it directly treats the symptom of devastating fires and appeases the public. However, the SD analysis indicates that a policy emphasizing suppression can degrade the long-run effectiveness of forest fire management. By crowding out efforts to preventative fuel removal, it exacerbates fuel loads and leads to greater fires, which further balloon suppression budgets. The business management literature refers to this problem as the firefighting trap, wherein focus on fixing problems diverts attention from preventing them, and thus leads to inferior outcomes. The paper illustrates these phenomena through a case study of Portugal, showing that a balanced approach to suppression and prevention efforts can mitigate the self-reinforcing consequences of this trap, and better manage long-term fire damages. These insights can help policymakers and fire managers better appreciate the interconnected systems in which their authorities reside and the dynamics that may undermine seemingly rational management decisions.

Abstract
This paper is addressed to the generalization of simple plant location problem where customer's preferences are taken into account. Some basic polyhedral studies and a new family of facet-defining inequalities are given. The effectiveness of the proposed approach is illustrated by the computational experience.