Abstract
In this paper we present a genetic algorithm with new components to tackle capacitated lot sizing and scheduling problems with sequence dependent setups that appear in a wide range of industries, from soft drink bottling to food manufacturing. Finding a feasible solution to highly constrained problems is often a very difficult task. Various strategies have been applied to deal with infeasible solutions throughout the search. We propose a new scheme of classifying individuals based on nested domains to determine the solutions according to the level of infeasibility, which in our case represents bands of additional production hours (overtime). Within each band, individuals are just differentiated by their fitness function. As iterations are conducted, the widths of the bands are dynamically adjusted to improve the convergence of the individuals into the feasible domain. The numerical experiments on highly capacitated instances show the effectiveness of this computational tractable approach to guide the search toward the feasible domain. Our approach outperforms other state-of-the-art approaches and commercial solvers.

Abstract
This article describes a real-world production planning and scheduling problem occurring at an integrated pulp and paper mill (P&P) which manufactures paper for cardboard out of produced pulp. During the cooking of wood chips in the digester, two by-products are produced: the pulp itself (virgin fibers) and the waste stream known as black liquor. The former is then mixed with recycled fibers and processed in a paper machine. Here, due to significant sequence-dependent setups in paper type changeovers, sizing and sequencing of lots have to be made simultaneously in order to efficiently use capacity. The latter is converted into electrical energy using a set of evaporators, recovery boilers and counter-pressure turbines. The planning challenge is then to synchronize the material flow as it moves through the pulp and paper mills, and energy plant, maximizing customer demand (as backlogging is allowed), and minimizing operation costs. Due to the intensive capital feature of P&P, the output of the digester must be maximized. As the production bottleneck is not fixed, to tackle this problem we propose a new model that integrates the critical production units associated to the pulp and paper mills, and energy plant for the first time. Simple stochastic mixed integer programming based local search heuristics are developed to obtain good feasible solutions for the problem. The benefits of integrating the three stages are discussed. The proposed approaches are tested on real-world data. Our work may help P&P companies to increase their competitiveness and reactiveness in dealing with demand pattern oscillations.

Abstract
In production planning, sequence dependent setup times and costs are often incurred for switchovers from one product to another. When setup times and costs do not respect the triangular inequality, a situation may occur where the optimal solution includes more than one batch of the same product in a single period-in other words, at least one sub tour exists in the production sequence of that period. By allowing setup crossovers, flexibility is increased and better solutions can be found. In tight capacity conditions, or whenever setup times are significant, setup crossovers are needed to assure feasibility. We present the first linear mixed-integer programming extension for the capacitated lot-sizing and scheduling problem incorporating all the necessary features of sequence sub tours and setup crossovers. This formulation is more efficient than other well known lot-sizing and scheduling models.

Abstract
From lone to short term planning, the decision processes inherent to surgery theatre organization are often subject of empiricism. The current hospital information systems available on Portuguese public hospitals lack a decision support system component that could help achieve better planning solutions, thus better operational performance of the surgery theatre. Since the surgery theatre is the biggest hospital budget consumer, the use of surgery related resources and its intrinsic planning must be carefully studied. We developed a new decision support system for surgery planning conjointly with one of the largest hospitals in the north of Portugal. As for now, the goals of the DSS are to improve the planning process and increase policy compliance. We will enhance this framework by integrating data mining, optimization and simulation techniques in a way that enables a more accurate representation of the surgery theatre problems' stochastic nature, allowing the users to rind enhanced planning alternatives.

Abstract
This paper presents a combination of optimization and data mining techniques to address the surgery scheduling problem. In this approach, we first develop a model to predict the duration of the surgeries using a data mining algorithm. The prediction model outcomes are then used by a mathematical optimization model to schedule surgeries in an optimal way. In this paper, we present the results of using three different data mining algorithms to predict the duration of surgeries and compare them with the estimates made by surgeons. The results obtained by the data mining models show an improvement in estimation accuracy of 36%.We also compare the schedules generated by the optimization model based on the estimates made by the prediction models against reality. Our approach enables an increase in the number of surgeries performed in the operating theater, thus allowing a reduction on the average waiting time for surgery and a reduction in the overtime and undertime per surgery performed. These results indicate that the proposed approach can help the hospital improve significantly the efficiency of resource usage and increase the service levels. © Springer-Verlag 2012.

Abstract
We address the short-term production planning and scheduling problem coming from the glass container industry. A furnace melts the glass that is distributed to a set of parallel molding machines. Both furnace and machine idleness are not allowed. The resulting multi-machine multi-item continuous setup lotsizing problem with a common resource has sequence-dependent setup times and costs. Production losses are penalized in the objective function since we deal with a capital intensive industry. We present two mixed integer programming formulations for this problem, which are reduced to a network flow type problem. The two formulations are improved by adding valid inequalities that lead to good lower bounds. We rely on a Lagrangian decomposition based heuristic for generating good feasible solutions. We report computational experiments for randomly generated instances and for real-life data on the aforementioned problem, as well as on a discrete lotsizing and scheduling version.