10 research outputs found
Modeling and scheduling no-idle hybrid flow shop problems
Although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. But, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. This paper considers the problem of scheduling no-idle hybrid flow shops. A mixed integer linear programming model is first developed to mathematically formulate the problem. Using commercial software, the model can solve small instances to optimality. Then, two metaheuristics based on variable neighborhood search and genetic algorithms are developed to solve larger instances. Using numerical experiments, the performance of the model and algorithms are evaluated.Although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. But, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. This paper considers the problem of scheduling no-idle hybrid flow shops. A mixed integer linear programming model is first developed to mathematically formulate the problem. Using commercial software, the model can solve small instances to optimality. Then, two metaheuristics based on variable neighborhood search and genetic algorithms are developed to solve larger instances. Using numerical experiments, the performance of the model and algorithms are evaluated
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
A Mathematical Programming Model for Tactical Planning with Set-up Continuity in a Two-stage Ceramic Firm
[EN] It is known that capacity issues in tactical production plans in a hierarchical context are relevant since its inaccurate determination may lead to unrealistic or simply non-feasible plans at the operational level. Semi-continuous industrial processes, such as ceramic ones, often imply large setups and their consideration is crucial for accurate capacity estimation. However, in most of production planning models developed in a hierarchical context at this tactical (aggregated) level, setup changes are not explicitly considered. Their consideration includes not only decisions about lot sizing of production, but also allocation, known as Capacitated Lot Sizing and Loading Problem (CLSLP). However, CLSLP does not account for set-up continuity, specially important in contexts with lengthy and costly set-ups and where product families minimum run length are similar to planning periods. In this work, a mixed integer linear programming (MILP) model for a two stage ceramic firm which accounts for lot sizing and loading decisions including minimum lot-sizes and set-up continuity between two consecutive periods is proposed. Set-up continuity inclusion is modelled just considering which product families are produced at the beginning and at the end of each period of time, and not the complete sequence. The model is solved over a simplified two-stage real-case within a Spanish ceramic firm. Obtained results confirm its validity.Pérez Perales, D.; Alemany, ME. (2016). A Mathematical Programming Model for Tactical Planning with Set-up Continuity in a Two-stage Ceramic Firm. International Journal of Production Management and Engineering. 4(2):53-64. doi:10.4995/ijpme.2016.5209SWORD53644
A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
In this paper, we propose a simple but efficient heuristic that combines construction and improvement heuristic ideas to solve multi-level lot-sizing problems. A relax-and-fix heuristic is firstly used to build an initial solution, and this is further improved by applying a fix-and-optimize heuristic. We also introduce a novel way to define the mixed-integer subproblems solved by both heuristics. The efficiency of the approach is evaluated solving two different classes of multi-level lot-sizing problems: the multi-level capacitated lot-sizing problem with backlogging and the two-stage glass container production scheduling problem (TGCPSP). We present extensive computational results including four test sets of the Multi-item Lot-Sizing with Backlogging library, and real-world test problems defined for the TGCPSP, where we benchmark against state-of-the-art methods from the recent literature. The computational results show that our combined heuristic approach is very efficient and competitive, outperforming benchmark methods for most of the test problems
Adaptive genetic algorithm based on fuzzy reasoning for the multilevel capacitated lot-sizing problem with energy consumption in synchronizer production
The multilevel capacitated lot-sizing problem (MLCLSP) is a vital theoretical problem of production planning in discrete manufacturing. An improved algorithm based on the genetic algorithm (GA) is proposed to solve the MLCLSP. Based on the solution results, the distribution of energy consumption in a synchronous production case is analyzed. In the related literature, the GA has become a much-discussed topic in solving these kinds of problems. Although the standard GA can make up for the defects of the traditional algorithm, it will lead to the problems of unstable solution results and easy local convergence. For these reasons, this research presents an adaptive genetic algorithm based on fuzzy theory (fuzzy-GA) to solve the MLCLSP. Firstly, the solving process of the MLCLSP with the fuzzy-GA is described in detail, where algorithms for key technologies such as the capacity constraint algorithm and the algorithm of solving fitness value are developed. Secondly, the auto-encoding of decision variables for MLCLSPs is studied; within this, the decision variables of whether to produce or not are encoded into a hierarchical structure based on the bill of material; combined with external demand, the decision variables of lot-sizing are constructed. Thirdly, the adaptive optimization process of parameters of the GA for the MLCLSP based on fuzzy theory is expounded, in which membership function, fuzzy rule, and defuzzification of the MLCLSP is mainly presented. Experimental studies using the processed dataset collected from a synchronizer manufacturer have demonstrated the merits of the proposed approach, in which the energy consumption distribution of the optimized production plan is given. The optimal lot-sizing is closer to the average value of the optimal value compared with the standard GA, which indicates that the proposed fuzzy-GA approach has better convergence and stability
Algoritmo heurÃstico basado en listas tabú para la planificación de la producción en sistemas multinivel con listas de materiales alternativas y entornos de coproducción
MaestrÃa en IngenierÃaEn esta investigación se presenta el desarrollo un algoritmo heurÃstico basado en los principios de búsqueda tabú para la solución del problema de lotificación multinivel con restricciones de capacidad, listas de materiales alternativas y entornos de coproducción,
basado en la estructura del modelo de Planificación de Materiales y Operaciones Genéricas
GMOP propuesto en el año 2013. El algoritmo propuesto utiliza el mecanismo de memoria a corto plazo (Lista Tabú) para la selección de Strokes alternativos para la fabricación de cada producto. La validación del algoritmo se realizó analizando la calidad y los tiempos de
obtención de las soluciones. El algoritmo demostró potencial al alcanzar porcentajes de diferencia entre el 10% y 17% con respecto a las soluciones óptimas en los problemas de mayor tamaño y un equilibrio entre calidad y tiempos de solución problemas relativamente pequeños.This research shows the development process of a heuristic algorithm based on the principles of taboo search for the solution of the capacitated multilevel lot sizing problem with alternate bill of materials and co-production environments, based on the structure of the Generic Materials and Operations Planning model (GMOP). The proposed algorithm uses the short-term memory mechanism (Taboo List) for the selection of alternate strokes to produce each product. The validation of the algorithm was carried out analyzing the quality and the solution times. The algorithm demonstrated potential by reaching difference percentages around 10% and 17% compared with optimal solutions in large problems and a balance between quality and solution times when is used in relatively small problems
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
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