Please use this identifier to cite or link to this item: https://hdl.handle.net/10216/6618
Full metadata record
DC FieldValueLanguage
dc.creatorBernardo Sobrinho Simões de Almada-Lobo
dc.date.accessioned2022-09-13T23:34:09Z-
dc.date.available2022-09-13T23:34:09Z-
dc.date.issued2007
dc.identifier.othersigarra:25698
dc.identifier.urihttps://hdl.handle.net/10216/6618-
dc.descriptionManufacturing organizations are keen to improve their competitive position in the global marketplace by increasing operational performance. Production planning is crucial to this end and represents one of the most challenging tasks managers are facing today. Among a large number of alternatives, production planning processes help decision-making by tradingoff conflicting objectives in the presence of technological, marketing and financial constraints. Two important classes of such problems are lotsizing and scheduling. Proofs from complexity theory supported by computational experiments clearly show the hardness of solving lotsizing and scheduling problems. Motivated by a real-world case, the glass container industry production planning and scheduling problem is studied in depth. Due to its inherent complexity and to the frequent interdependencies between decisions that are made at and affect different organizational echelons, the system is decomposed into a two-level hierarchically organized planning structure: long-term and short-term levels. This dissertation explores extensions of lotsizing and scheduling problems that appear in both levels. We address these variants in two research directions. On one hand, we develop and implement different approaches to obtain good quality solutions, as metaheuristics (namely variable neighborhood search) and Lagrangian-based heuristics, as well as other special-purpose heuristics. On the other hand, we try to combine new stronger models and valid inequalities based on the polyhedral structure of these problems to tighten linear relaxations and speed up the solution process.
dc.description.abstractManufacturing organizations are keen to improve their competitive position in the global marketplace by increasing operational performance. Production planning is crucial to this end and represents one of the most challenging tasks managers are facing today. Among a large number of alternatives, production planning processes help decision-making by tradingoff conflicting objectives in the presence of technological, marketing and financial constraints. Two important classes of such problems are lotsizing and scheduling. Proofs from complexity theory supported by computational experiments clearly show the hardness of solving lotsizing and scheduling problems. Motivated by a real-world case, the glass container industry production planning and scheduling problem is studied in depth. Due to its inherent complexity and to the frequent interdependencies between decisions that are made at and affect different organizational echelons, the system is decomposed into a two-level hierarchically organized planning structure: long-term and short-term levels. This dissertation explores extensions of lotsizing and scheduling problems that appear in both levels. We address these variants in two research directions. On one hand, we develop and implement different approaches to obtain good quality solutions, as metaheuristics (namely variable neighborhood search) and Lagrangian-based heuristics, as well as other special-purpose heuristics. On the other hand, we try to combine new stronger models and valid inequalities based on the polyhedral structure of these problems to tighten linear relaxations and speed up the solution process.
dc.language.isopor
dc.rightsopenAccess
dc.rights.urihttps://creativecommons.org/licenses/by-nc/4.0/
dc.subjectEngenharia industrial
dc.subjectIndustrial engineering
dc.titleLotsizing and scheduling in the glass container industry
dc.typeTese
dc.contributor.uportoFaculdade de Engenharia
Appears in Collections:FEUP - Tese

Files in This Item:
File Description SizeFormat 
25698.pdf3.46 MBAdobe PDFThumbnail
View/Open


This item is licensed under a Creative Commons License Creative Commons