119 research outputs found
Improvement to an existing multi-level capacitated lot sizing problem considering setup carryover, backlogging, and emission control
This paper presents a multi-level, multi-item, multi-period capacitated lot-sizing problem. The lot-sizing problem studies can obtain production quantities, setup decisions and inventory levels in each period fulfilling the demand requirements with limited capacity resources, considering the Bill of Material (BOM) structure while simultaneously minimizing the production, inventory, and machine setup costs. The paper proposes an exact solution to Chowdhury et al. (2018)\u27s[1] developed model, which considers the backlogging cost, setup carryover & greenhouse gas emission control to its model complexity. The problem contemplates the Dantzig-Wolfe (D.W.) decomposition to decompose the multi-level capacitated problem into a single-item uncapacitated lot-sizing sub-problem. To avoid the infeasibilities of the weighted problem (WP), an artificial variable is introduced, and the Big-M method is employed in the D.W. decomposition to produce an always feasible master problem. In addition, Wagner & Whitin\u27s[2] forward recursion algorithm is also incorporated in the solution approach for both end and component items to provide the minimum cost production plan. Introducing artificial variables in the D.W. decomposition method is a novel approach to solving the MLCLSP model. A better performance was achieved regarding reduced computational time (reduced by 50%) and optimality gap (reduced by 97.3%) in comparison to Chowdhury et al. (2018)\u27s[1] developed model
An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
This paper proposes two new mixed integer programming models for capacitated multi-level lot-sizing problems with backlogging, whose linear programming relaxations provide good lower bounds on the optimal solution value. We show that both of these strong formulations yield the same lower bounds. In addition to these theoretical results, we propose a new, effective optimization framework that achieves high quality solutions in reasonable computational time. Computational results show that the proposed optimization framework is superior to other well-known approaches on several important performance dimensions
Proceedings of the third International Workshop of the IFIP WG5.7
Contents of the papers presented at the international workshop deal with the wide variety of new and computer-based techniques for production planning and control that has become available to the scientific and industrial world in the past few years: formal modeling techniques, artificial neural networks, autonomous agent theory, genetic algorithms, chaos theory, fuzzy logic, simulated annealing, tabu search, simulation and so on. The approach, while being scientifically rigorous, is focused on the applicability to industrial environment
Lot-Sizing Problem for a Multi-Item Multi-level Capacitated Batch Production System with Setup Carryover, Emission Control and Backlogging using a Dynamic Program and Decomposition Heuristic
Wagner and Whitin (1958) develop an algorithm to solve the dynamic Economic Lot-Sizing Problem (ELSP), which is widely applied in inventory control, production planning, and capacity planning. The original algorithm runs in O(T^2) time, where T is the number of periods of the problem instance. Afterward few linear-time algorithms have been developed to solve the Wagner-Whitin (WW) lot-sizing problem; examples include the ELSP and equivalent Single Machine Batch-Sizing Problem (SMBSP). This dissertation revisits the algorithms for ELSPs and SMBSPs under WW cost structure, presents a new efficient linear-time algorithm, and compares the developed algorithm against comparable ones in the literature. The developed algorithm employs both lists and stacks data structure, which is completely a different approach than the rest of the algorithms for ELSPs and SMBSPs. Analysis of the developed algorithm shows that it executes fewer number of basic actions throughout the algorithm and hence it improves the CPU time by a maximum of 51.40% for ELSPs and 29.03% for SMBSPs. It can be concluded that the new algorithm is faster than existing algorithms for both ELSPs and SMBSPs. Lot-sizing decisions are crucial because these decisions help the manufacturer determine the quantity and time to produce an item with a minimum cost. The efficiency and productivity of a system is completely dependent upon the right choice of lot-sizes. Therefore, developing and improving solution procedures for lot-sizing problems is key. This dissertation addresses the classical Multi-Level Capacitated Lot-Sizing Problem (MLCLSP) and an extension of the MLCLSP with a Setup Carryover, Backlogging and Emission control. An item Dantzig Wolfe (DW) decomposition technique with an embedded Column Generation (CG) procedure is used to solve the problem. The original problem is decomposed into a master problem and a number of subproblems, which are solved using dynamic programming approach. Since the subproblems are solved independently, the solution of the subproblems often becomes infeasible for the master problem. A multi-step iterative Capacity Allocation (CA) heuristic is used to tackle this infeasibility. A Linear Programming (LP) based improvement procedure is used to refine the solutions obtained from the heuristic method. A comparative study of the proposed heuristic for the first problem (MLCLSP) is conducted and the results demonstrate that the proposed heuristic provide less optimality gap in comparison with that obtained in the literature. The Setup Carryover Assignment Problem (SCAP), which consists of determining the setup carryover plan of multiple items for a given lot-size over a finite planning horizon is modelled as a problem of finding Maximum Weighted Independent Set (MWIS) in a chain of cliques. The SCAP is formulated using a clique constraint and it is proved that the incidence matrix of the SCAP has totally unimodular structure and the LP relaxation of the proposed SCAP formulation always provides integer optimum solution. Moreover, an alternative proof that the relaxed ILP guarantees integer solution is presented in this dissertation. Thus, the SCAP and the special case of the MWIS in a chain of cliques are solvable in polynomial time
A review of discrete-time optimization models for tactical production planning
This is an Accepted Manuscript of an article published in International Journal of Production Research on 27 Mar 2014, available online: http://doi.org/10.1080/00207543.2014.899721[EN] This study presents a review of optimization models for tactical production planning. The objective of this research is to identify streams and future research directions in this field based on the different classification criteria proposed. The major findings indicate that: (1) the most popular production-planning area is master production scheduling with a big-bucket time-type period; (2) most of the considered limited resources correspond to productive resources and, to a lesser extent, to inventory capacities; (3) the consideration of backlogs, set-up times, parallel machines, overtime capacities and network-type multisite configuration stand out in terms of extensions; (4) the most widely used modelling approach is linear/integer/mixed integer linear programming solved with exact algorithms, such as branch-and-bound, in commercial MIP solvers; (5) CPLEX, C and its variants and Lindo/Lingo are the most popular development tools among solvers, programming languages and modelling languages, respectively; (6) most works perform numerical experiments with random created instances, while a small number of works were validated by real-world data from industrial firms, of which the most popular are sawmills, wood and furniture, automobile and semiconductors and electronic devices.This study has been funded by the Universitat Politècnica de València projects: ‘Material Requirement Planning Fourth Generation
(MRPIV)’ (Ref. PAID-05-12) and ‘Quantitative Models for the Design of Socially Responsible Supply Chains under Uncertainty
Conditions. Application of Solution Strategies based on Hybrid Metaheuristics’ (PAID-06-12).Díaz-Madroñero Boluda, FM.; Mula, J.; Peidro Payá, D. (2014). A review of discrete-time optimization models for tactical production planning. International Journal of Production Research. 52(17):5171-5205. doi:10.1080/00207543.2014.899721S51715205521
Simultaneous lotsizing and scheduling - extensions and solution approaches
The present thesis focuses on simultaneous lotsizing and scheduling. A comprehensive review of the literature is presented in which the historical development of the subject and the current research gaps are, based on a classification scheme, described.
Additionally, a review focusing on so-called secondary resources (e.g., setup operators or raw materials), which are considered alongside the primary production resource, is provided. The insights on different types of secondary resources help to develop a new model formulation generalizing and extending the currently used approaches, which are specific to certain settings. Some illustrative examples demonstrate the functional principle and flexibility of this new formulation which can thus be used in a wide range of applications.
Finally, a new heuristic to solve large-scaled simultaneous lotsizing and scheduling problems is presented. The heuristic creates a modified multi-line master problem by aggregating products into groups. The resulting problem is less complex and its solution can be used to define single-line sub problems. These sub problems are solved by heuristics present in the literature and the results are then combined to form a solution to the original problem. Numerical tests show the applicability of the aforementioned approach to solve problems of practical relevance.Die vorliegende Ausarbeitung betrachtet das Thema der simultanen Losgrößen- und Reihenfolgeplanung tiefergehend. Ein ausführlicher Literaturüberblick zeigt unter Zuhilfenahme eines Klassifizierungsschemas den Entwicklungsverlauf und aktuelle Forschungslücken in diesem Bereich auf.
Weiterhin wird ein auf zusätzliche Ressourcen (sogenannte secondary resources) fokussierter Literaturüberblick erstellt. Diese Ressourcen (z.B. Personal zur Umrüstung oder Rohmaterial) werden zusätzlich zu der primären Produktionsressource benötigt. Die Erkenntnisse zu den verschiedenen Typen von zusätzlichen Ressourcen werden verwendet, um ein generelles Modell zu entwickeln, welches die bisherigen, auf bestimmte Anwendungsfälle spezialisierten, Formulierungen abbildet und erweitert. Testläufe mit Beispielszenarien demonstrieren die Funktionalität und die Flexibilität der neuen Modellformulierung welche für einen Vielzahl von Anwendungsfällen verwendet werden kann.
Abschließend wird eine neue Heuristik zum Lösen von simultanen Losgrößen- und Reihenfolgeplanungsproblemen praxisrelevanter Größen vorgestellt. Innerhalb der Heuristik wird durch Produktaggregation ein modifiziertes Mehrlinien-Masterproblem generiert. Das resultierende Problem ist weniger komplex und die dafür gefundene Lösung kann zum Erstellen von Einlinien-Teilproblemen verwendet werden. Diese Teilprobleme werden mit aus der Literatur bekannten Heuristiken gelöst. Die Ergebnisse werden zu einer Lösung für das ursprüngliche Problem zusammengefasst. Numerische Tests belegen die Tauglichkeit des Verfahrens zum Lösen von praxisrelevanten Problemen
Recommended from our members
A Digital Twin Framework for Production Planning Optimization: Applications for Make-To-Order Manufacturers
In this dissertation, we develop a Digital Twin framework for manufacturing systems and apply it to various production planning and scheduling problems faced by Make-To-Order (MTO) firms. While this framework can be used to digitally represent a particular manufacturing environment with high fidelity, our focus is in using it to generate realistic settings to test production planning and scheduling algorithms in practice. These algorithms have traditionally been tested by either translating a practical situation into the necessary modeling constructs, without discussion of the assumptions and inaccuracies underlying this translation, or by generating random instances of the modeling constructs, without assessing the limitations in accurately representing production environments. The consequence has been a serious gap between theory advancement and industry practice. The major goal of this dissertation is to develop a framework that allows for practical testing, evaluation, and implementation of new approaches for seamless industry adoption. We develop this framework as a modular software package and emphasize the practicality and configurability of the framework, such that minimal modelling effort is required to apply the framework to a multitude of optimization problems and manufacturing systems. Throughout this dissertation, we emphasize the importance of the underlying scheduling problems which provide the basis for additional operational decision making. We focus on the computational evaluation and comparisons of various modeling choices within the developed frameworks, with the objective of identifying models which are both effective and computationally efficient. In Part 1 of this dissertation, we consider a class of Production Planning and Execution problems faced by job shop manufacturing systems. In Part 2 of this dissertation, we consider a class of scheduling problems faced by manufacturers whose production system is dominated by a single operation
Integrated Production and Distribution planning of perishable goods
Tese de doutoramento. Programa Doutoral em Engenharia Industrial e Gestão. Faculdade de Engenharia. Universidade do Porto. 201
Energy-aware coordination of machine scheduling and support device recharging in production systems
Electricity generation from renewable energy sources is crucial for achieving climate targets, including greenhouse gas neutrality. Germany has made significant progress in increasing renewable energy generation. However, feed-in management actions have led to losses of renewable electricity in the past years, primarily from wind energy. These actions aim to maintain grid stability but result in excess renewable energy that goes unused. The lost electricity could have powered a multitude of households and saved CO2 emissions. Moreover, feed-in management actions incurred compensation claims of around 807 million Euros in 2021. Wind-abundant regions like Schleswig-Holstein are particularly affected by these actions, resulting in substantial losses of renewable electricity production. Expanding the power grid infrastructure is a costly and time-consuming solution to avoid feed-in management actions. An alternative approach is to increase local electricity consumption during peak renewable generation periods, which can help balance electricity supply and demand and reduce feed-in management actions. The dissertation focuses on energy-aware manufacturing decision-making, exploring ways to counteract feed-in management actions by increasing local industrial consumption during renewable generation peaks. The research proposes to guide production management decisions, synchronizing a company's energy consumption profile with renewable energy availability for more environmentally friendly production and improved grid stability
- …