CEGI - Other Publications

Permanent URI for this collection

http://localhost:4000/handle/123456789/263

Browse

Browsing CEGI - Other Publications by Author "Bernardo Almada-Lobo"
  • Item
    Combining the principles of variable neighborhood decomposition search and the fix&optimize heuristic to solve multi-level lot-sizing and scheduling problems
    ( 2013) Seeanner,F ; Bernardo Almada-Lobo ; Meyr,H
    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.
  • Item
    Glass container production scheduling through hybrid multi-population based evolutionary algorithm
    ( 2013) Motta Toledo,CFM ; Arantes,MD ; Ribeiro de Oliveira,RRR ; Bernardo Almada-Lobo
    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.
  • Item
    Lot sizing versus batching in the production and distribution planning of perishable goods
    ( 2013) Pedro Amorim ; Belo Filho,MAF ; Toledo,FMB ; Almeder,C ; Bernardo Almada-Lobo
    Joint production and distribution planning at the operational level has received a great deal of attention from researchers. In most industries these processes are decoupled by means of final goods inventory that allow for a separated planning of these tasks. However, for example, in the catering industry, an integrated planning framework tends to be more favorable due to the perishable nature of the products that forces a make-to-order production strategy. So far this planning problem has only been addressed by allowing the batching of orders. The main contribution of this paper is to extend this approach and prove the importance of lot sizing for make-to-order systems when perishability is explicitly considered. The value of considering lot sizing versus batching is further investigated per type of production scenario. Overall, results indicate that lot sizing is able to deliver better solutions than batching. On average, for the improved instances, the cost savings ascend to 6.5% when using lot sizing. The added flexibility of lot sizing allows for a reduction on production setup costs and both fixed and variable distribution costs. The savings derived from lot sizing are enhanced by customer oriented time windows and production systems with non-triangular setups. © 2013 Elsevier B.V.
  • Item
    Pricing, relaxing and fixing under lot sizing and scheduling
    ( 2013) Luís Guimarães ; Klabjan,D ; Bernardo Almada-Lobo
    We present a novel mathematical model and a mathematical programming based approach to deliver superior quality solutions for the single machine capacitated lot sizing and scheduling problem with sequence-dependent setup times and costs. The formulation explores the idea of scheduling products based on the selection of known production sequences. The model is the basis of a matheuristic, which embeds pricing principles within construction and improvement MIP-based heuristics. A partial exploration of distinct neighborhood structures avoids local entrapment and is conducted on a rule-based neighbor selection principle. We compare the performance of this approach to other heuristics proposed in the literature. The computational study carried out on different sets of benchmark instances shows the ability of the matheuristic to cope with several model extensions while maintaining a very effective search. Although the techniques described were developed in the context of the problem studied, the method is applicable to other lot sizing problems or even to problems outside this domain.