An investigation into minimising total energy consumption and total completion time in a flexible job shop for recycling carbon fiber reinforced polymer

The increased use of carbon fiber reinforced polymer (CFRP) in industry coupled with European Union restrictions on landfill disposal has resulted in a need to develop relevant recycling technologies. Several methods, such as mechanical grinding, thermolysis and solvolysis, have been tried to recover the carbon fibers. Optimisation techniques for reducing energy consumed by above processes have also been developed. However, the energy efficiency of recycling CFRP at the workshop level has never been considered before. An approach to incorporate energy reduction into consideration while making the scheduling plans for a CFRP recycling workshop is presented in this paper. This research sets in a flexible job shop circumstance, model for the bi-objective problem that minimise total processing energy consumption and makespan is developed. A modified Genetic Algorithm for solving the raw material lot splitting problem is developed. A case study of the lot sizing problem in the flexible job shop for recycling CFRP is presented to show how scheduling plans affect energy consumption, and to prove the feasibility of the model and the developed algorithm

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

A Neighborhood Search for Sequence-dependent Setup Time in Flow Shop Fabrics Making of Textile Industry

Abstract This paper proposes a neighborhood search to solve scheduling for fabrics making in a textile industry. The production process consists of three production stages from spinning, weaving, and dyeing. All stages have one processor. Setup time between two consecutive jobs with different color is considered. This paper also proposes attribute’s decomposition of a single job to classify available jobs to be processed and to consider setup time between two consecutive jobs. Neighborhood search (NS) algorithm is proposed in which the permutation of set of jobs with same attribute and the permutation among set of jobs is conducted. Solution obtained from neighborhood search, which might be trapped in local solution, then is compared with other known optimal methods

Meta-Heuristics for Dynamic Lot Sizing: a review and comparison of solution approaches

Proofs from complexity theory as well as computational experiments indicate that most lot sizing problems are hard to solve. Because these problems are so difficult, various solution techniques have been proposed to solve them. In the past decade, meta-heuristics such as tabu search, genetic algorithms and simulated annealing, have become popular and efficient tools for solving hard combinational optimization problems. We review the various meta-heuristics that have been specifically developed to solve lot sizing problems, discussing their main components such as representation, evaluation neighborhood definition and genetic operators. Further, we briefly review other solution approaches, such as dynamic programming, cutting planes, Dantzig-Wolfe decomposition, Lagrange relaxation and dedicated heuristics. This allows us to compare these techniques. Understanding their respective advantages and disadvantages gives insight into how we can integrate elements from several solution approaches into more powerful hybrid algorithms. Finally, we discuss general guidelines for computational experiments and illustrate these with several examples

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

DYNAMIC LOT-SIZING PROBLEMS: A Review on Model and Efficient Algorithm

Due to their importance in industry, dynamic demand lot-sizing problems are frequently studied.This study consider dynamic lot-sizing problems with recent advances in problem and modelformulation, and algorithms that enable large-scale problems to be effectively solved.Comprehensive review is given on model formulation of dynamic lot-sizing problems, especiallyon capacitated lot-sizing (CLS) problem and the coordinated lot-sizing problem. Bothapproaches have their intercorrelated, where CLS can be employed for single or multilevel/stage, item, and some restrictions. When a need for joint setup replenishment exists, thenthe coordinated lot-sizing is the choice. Furthermore, both algorithmics and heuristics solutionin the research of dynamic lot sizing are considered, followed by an illustration to provide anefficient algorithm

Integration of production, maintenance and quality : Modelling and solution approaches

Dans cette thèse, nous analysons le problème de l'intégration de la planification de production et de la maintenance préventive, ainsi que l'élaboration du système de contrôle de la qualité. Premièrement, on considère un système de production composé d'une machine et de plusieurs produits dans un contexte incertain, dont les prix et le coût changent d'une période à l'autre. La machine se détériore avec le temps et sa probabilité de défaillance, ainsi que le risque de passage à un état hors contrôle augmentent. Le taux de défaillance dans un état dégradé est plus élevé et donc, des coûts liés à la qualité s’imposent. Lorsque la machine tombe en panne, une maintenance corrective ou une réparation minimale seront initiées pour la remettre en marche sans influer ses conditions ou le processus de détérioration. L'augmentation du nombre de défaillances de la machine se traduit par un temps d'arrêt supérieur et un taux de disponibilité inférieur. D'autre part, la réalisation des plans de production est fortement influencée par la disponibilité et la fiabilité de la machine. Les interactions entre la planification de la maintenance et celle de la production sont incorporées dans notre modèle mathématique. Dans la première étape, l'effet de maintenance sur la qualité est pris en compte. La maintenance préventive est considérée comme imparfaite. La condition de la machine est définie par l’âge actuel, et la machine dispose de plusieurs niveaux de maintenance avec des caractéristiques différentes (coûts, délais d'exécution et impacts sur les conditions du système). La détermination des niveaux de maintenance préventive optimaux conduit à un problème d’optimisation difficile. Un modèle de maximisation du profit est développé, dans lequel la vente des produits conformes et non conformes, les coûts de la production, les stocks tenus, la rupture de stock, la configuration de la machine, la maintenance préventive et corrective, le remplacement de la machine et le coût de la qualité sont considérés dans la fonction de l’objectif. De plus, un système composé de plusieurs machines est étudié. Dans cette extension, les nombres optimaux d’inspections est également considéré. La fonction de l’objectif consiste à minimiser le coût total qui est la somme des coûts liés à la maintenance, la production et la qualité. Ensuite, en tenant compte de la complexité des modèles préposés, nous développons des méthodes de résolution efficaces qui sont fondées sur la combinaison d'algorithmes génétiques avec des méthodes de recherches locales. On présente un algorithme mimétique qui emploi l’algorithme Nelder-Mead, avec un logiciel d'optimisation pour déterminer les valeurs exactes de plusieurs variables de décisions à chaque évaluation. La méthode de résolution proposée est comparée, en termes de temps d’exécution et de qualités des solutions, avec plusieurs méthodes Métaheuristiques. Mots-clés : Planification de la production, Maintenance préventive imparfaite, Inspection, Qualité, Modèles intégrés, MétaheuristiquesIn this thesis, we study the integrated planning of production, maintenance, and quality in multi-product, multi-period imperfect systems. First, we consider a production system composed of one machine and several products in a time-varying context. The machine deteriorates with time and so, the probability of machine failure, or the risk of a shift to an out-of-control state, increases. The defective rate in the shifted state is higher and so, quality related costs will be imposed. When the machine fails, a corrective maintenance or a minimal repair will be initiated to bring the machine in operation without influencing on its conditions or on the deterioration process. Increasing the expected number of machine failures results in a higher downtime and a lower availability rate. On the other hand, realization of the production plans is significantly influenced by the machine availability and reliability. The interactions between maintenance scheduling and production planning are incorporated in the mathematical model. In the first step, the impact of maintenance on the expected quality level is addressed. The maintenance is also imperfect and the machine conditions after maintenance can be anywhere between as-good-as-new and as-bad-as-old situations. Machine conditions are stated by its effective age, and the machine has several maintenance levels with different costs, execution times, and impacts on the system conditions. High level maintenances on the one hand have greater influences on the improvement of the system state and on the other hand, they occupy more the available production time. The optimal determination of such preventive maintenance levels to be performed at each maintenance intrusion is a challenging problem. A profit maximization model is developed, where the sale of conforming and non-conforming products, costs of production, inventory holding, backorder, setup, preventive and corrective maintenance, machine replacement, and the quality cost are addressed in the objective function. Then, a system with multiple machines is taken into account. In this extension, the number of quality inspections is involved in the joint model. The objective function minimizes the total cost which is the sum of maintenance, production and quality costs. In order to reduce the gap between the theory and the application of joint models, and taking into account the complexity of the integrated problems, we have developed an efficient solution method that is based on the combination of genetic algorithms with local search and problem specific methods. The proposed memetic algorithm employs Nelder-Mead algorithm along with an optimization package for exact determination of the values of several decision variables in each chromosome evolution. The method extracts not only the positive knowledge in good solutions, but also the negative knowledge in poor individuals to determine the algorithm transitions. The method is compared in terms of the solution time and quality to several heuristic methods. Keywords : Multi-period production planning, Imperfect preventive maintenance, Inspection, Quality, Integrated model, Metaheuristic