A Mathematical Approach to the Design of Cellular Manufacturing System Considering Dynamic Production Planning and Worker Assignments

Due to increasing international competition, shorter product life-cycles, variable demand, diverse customer needs and customized products, manufacturers are forced from mass production to the production of a large product mix. Traditional manufacturing systems, such as job shops and flow lines, cannot provide such requirements efficiently coupled with flexibility to handle these changes. Cellular Manufacturing (CM) is an alternate manufacturing system combining the high throughput rates of line layouts with the flexibility offered by functional layouts (job shops). The benefits include reduced set-up times, material handling, in-process inventory, better product quality, and faster response time. The benefits of CM can only be achieved by sufficiently incorporating the real-life structural and operational features of a manufacturing plant when creating the cellular layout. This research presents integrated CM models, with an extensive coverage of important manufacturing structural and operational features. The proposed Dynamic Cellular Manufacturing Systems (DCMSs) model considers several manufacturing attributes such as multiperiod production planning, dynamic system relocation, duplicate machines, machine capacities, available time for workers, worker assignments, and machine breakdowns. The objective is to minimize total manufacturing cost comprised of holding cost, outsourcing cost, intercell material handling cost, maintenance and overhead cost, machine relocation cost as well as salary, hiring, and firing costs of the workers. Numerical examples are presented to show the performance of the model

Modeling reliability considerations in the design and analysis of cellular manufacturing systems.

Reliability plays a vital role in the overall performance of cellular manufacturing systems (CMSs). Machine failures significantly impact the fulfillment of due dates and other performance criteria, despite the option of part rerouting to alternative workstations. These facts suggest a need for the consideration of machine reliability during the operation allocation process. Attempting to improve a system\u27s reliability invariably results in higher costs. It follows that the ideal strategy for achieving optimum balance lies in an approach that integrates both cost and reliability information. A mixed integer multi-objective mathematical programming model that incorporates machine reliability and cost considerations is developed for the design of CMSs. The model selects processing route for each part type which maximizes the overall system reliability of machines along the route, while minimizing the overall costs. The proposed approach provides flexible routing, ensuring high CMS performance by minimizing the impact of machine failure through the provision of alternative process routes. To account for the constant and increasing failure pattern of manufacturing machines, the CMS design model considers both the exponential and Weibull distribution approaches. A performance evaluation criterion in terms of system availability for the part-process plan assignment based on the exponential distribution is also developed. Applicability of the model is demonstrated by solving example problems by following the ∈-constraint approach. Optimization techniques for solving such models for large practical-size problems require a substantial amount of time and memory space; therefore, a heuristic, based on the basic steps to simulated annealing and solution generation procedure of genetic algorithm is developed. The heuristic is evaluated by comparing the solutions generated by the heuristic with the LP relaxation solution for the large problems and optimal solution for the smaller-sized problems. The results reveal that the heuristic performs well in various problem instances for reliability and cost combinations. The sensitivity of the model outputs to key factors has also been investigated. A reliability-based, preventive maintenance (PM) planning model is also incorporated, allowing CMS to restrict deterioration of machines due to usage and age and improve system reliability. A procedure for the integration of PM planning into the CMS design model is included for overall reliability and cost improvement of the CMS. Example problems are solved to illustrate the model\u27s applicability.* *This dissertation is a compound document (contains both a paper copy and a CD as part of the dissertation).Dept. of Industrial and Manufacturing Systems Engineering. Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis2006 .D37. Source: Dissertation Abstracts International, Volume: 67-07, Section: B, page: 4032. Thesis (Ph.D.)--University of Windsor (Canada), 2006

Evolutionary algorithms for multi-objective flexible job shop cell scheduling

The multi-objective flexible job shop scheduling in a cellular manufacturing environment is a challenging real-world problem. This recently introduced scheduling problem variant considers exceptional parts, intercellular moves, intercellular transportation times, sequence-dependent family setup times, and recirculation requiring minimization of makespan and total tardiness, simultaneously. A previous study shows that the exact solver based on mixed-integer nonlinear programming model fails to find an optimal solution to each of the ‘medium’ to ‘large’ size instances considering even the simplified version of the problem. In this study, we present evolutionary algorithms for solving that bi-objective problem and apply genetic and memetic algorithms that use three different scalarization methods, including weighted sum, conic, and tchebycheff. The performance of all evolutionary algorithms with various configurations is investigated across forty-three benchmark instances from ‘small’ to ‘large’ size including a large real-world problem instance. The experimental results show that the transgenerational memetic algorithm using weighted sum outperforms the rest producing the best-known results for almost all bi-objective flexible job shop cell scheduling instances, in overall

Conception de systèmes manufacturiers cellulaires dans un environnement de chaînes d'approvisionnement

Classical cellular manufacturing system (CMS) design are performed on a single plant and are no more appropriate in an environment where material procurement and Customer delivery processes issues with the selection of multi-plant production system locations have to be considered simultaneously. Integration of these issues is a crucial challenge to supply chain managers. This thesis deals with the multi-plant CMS design in a supply chain environment. This context is established with considering the supply or the customer delivery processes, and with linked manufacturing plants. Three problems are examined. The first problem considers linked multi-plant CMS design integrated to material supply process. The solution approach is based on a proposed linearised model where the total system design cost to minimise combines the cost of the cellular configuration set on existing plants and the costs linked to supplier process selection. Experimentation demonstrates the potential benefits gained through increasing routing flexibility over plants on investment costs and the effect of integrating the supply process in a multi-plant cellular manufacturing configuration. The second problem combines multi-plant CMS design to manufacturing plant selection and customer demand allocation decisions. We propose a mathematical model and develop a simulated annealing based approach which aims to select the manufacturing plants to open and define the machine cells locations and structures and assign customer’s demand. We demonstrate the efficiency of the solution approach and show the cost savings due to integrated multi-stage multi-plant CMS with customer allocation decisions, compared to a sequential decision process. The third problem examines a context of multi-period customer demand where multi-plant production planning decisions, part transfer between plants, system reconfiguration and dynamic customer allocation decisions are coupled with dynamic multi-plant CMS configuration. It is shown that considering these issues in an integrated model reduces total design cost and enhances manufacturing and delivery flexibility

Esnek atölye tipi hücre çizelgeleme problemleri için çok amaçlı matematiksel model ve genetik algoritma ile çözüm önerisi

06.03.2018 tarihli ve 30352 sayılı Resmi Gazetede yayımlanan “Yükseköğretim Kanunu İle Bazı Kanun Ve Kanun Hükmünde Kararnamelerde Değişiklik Yapılması Hakkında Kanun” ile 18.06.2018 tarihli “Lisansüstü Tezlerin Elektronik Ortamda Toplanması, Düzenlenmesi ve Erişime Açılmasına İlişkin Yönerge” gereğince tam metin erişime açılmıştır.Günümüz rekabetçi iş ortamında, müşteriler daha düşük maliyetle daha yüksek kalitede çeşitli ürünleri satın almak istemektedir. İmalat firmaları, talep çeşitliliğini karşılamak için yüksek derecede ürün çeşitliliğine ve küçük imalat parti büyüklüğüne ihtiyaç duymaktadır. Üretimdeki ürün çeşitlilikleri uzun hazırlık ve taşıma süreleri, karmaşık çizelgeleme problemleri gibi birçok probleme neden olmaktadır. Geleneksel imalat sistemleri, bu tip değişikliklere cevap vermede yeterince esnek değilken Hücresel Üretim Sistemleri üreticilerin bu ihtiyaçlarına cevap verebilecek özelliklere sahiptir. Ayrıca gerçek hayat problemlerinin çoğunda, bir parçanın bazı ya da bütün operasyonları birden fazla makinede işlem görebilmekte ve bazen de bu operasyonlar bir makineyi ya da iş merkezini birden fazla kez ziyaret etmektedir. Bu seçenek sisteme esneklik kazandırırken bu kadar karmaşık bir üretim sisteminin başarılı ve doğru bir şekilde işletilebilmesi kaynakların etkin kullanılmasını da gerektirmektedir. Bu çalışma, istisnai parçaları, hücrelerarası hareketleri, hücrelerarası taşıma sürelerini, sıra bağımlı parça ailesi hazırlık sürelerini ve yeniden işlem gören parçaları dikkate alarak hücresel imalat ortamında esnek atölye tipi çizelgeleme probleminin çözümüne dair bir matematiksel model ve çözüm yöntemi sunmaktadır. Mevcut bilgilerimiz ışığında yapılan bu çalışma Esnek Atölye Tipi Hücre Çizelgeleme Probleminde (EATHÇP) çok amaçlı matematiksel model ve meta-sezgiselinin kullanımı için ilk girişimdir. Bununla birlikte gerçek hayat uygulamaları için EATHÇP süreci, birçok çelişen amacı dikkate almayı gerektirdiği için ele alınan skalerleştirme metodu pratik uygulama ve teorik araştırma açısından oldukça önemlidir. Önerilen karma tamsayılı doğrusal olmayan matematiksel modelle küçük ve orta boyutlu problemler çözülebilmektedir. Büyük boyutlu problemlerin çözümü, doğrusal olmayan modellerle makul zamanlarda olamayacağı ya da çok uzun süreceği için konik skalerleştirmeli çok amaçlı matematiksel modeli kullanan bir Genetik Algoritma (GA) meta-sezgisel çözüm yöntemi önerilmiştir. GA yaklaşımının en iyi veya en iyiye yakın çözüme ulaşmasına etki eden parametrelerin en iyi kombinasyonu belirlemek amacı ile bir deney tasarımı gerçekleştirilmiştir. Bu tez çalışması için Eskişehir Tülomsaş Motor Fabrikası'nda bir uygulama çalışması yürütülmüştür. Yürütülen bu çalışma, altı farklı amaç ağırlık değerleri kullanılarak hem konik skalerleştirmeli GA yaklaşımı ile hem de ağırlıklı toplam skalerleştirmeli GA yaklaşımı ile çözülmüştür. Amaç ağırlıklarının beşinde çok amaçlı konik skalerleştirme GA yaklaşımının daha baskın sonuçlara ulaşabildiği vurgulanmıştır. Ayrıca, önerilen çok amaçlı modelin gerçek hayat problemleri için de makul zamanda uygun çözümler üretebildiği gösterilmiştir.In today's highly competitive business environment, customers desire to buy various products with higher quality at lower costs. Manufacturing firms require a high degree of product variety and small manufacturing lot sizes to meet the demand variability. The product variations in manufacturing cause many problems such as lengthy setup and transportation times, complex scheduling. Cellular Manufacturing Systems contain the characteristics, which will respond to the needs of manufacturers, even though Conventional Manufacturing Systems are not flexible enough to respond to changes. In addition, in most real life manufacturing problems, some or all operations of a part can be processed on more than one machine, and sometimes operations may visit a machine or work center more than once. It is necessary to use resources effectively in order to run such a complex production system successfully. In this study, a mathematical model and a solution approach that deals with a flexible job shop scheduling problem in cellular manufacturing environment is proposed by taking into consideration exceptional parts, intercellular moves, intercellular transportation times, sequence-dependent family setup times, and recirculation. To the best of our knowledge, this is the first attempt to use multi-objective mathematical model and meta-heuristic approach for a Flexible Job Shop Cell Scheduling Problem (FJCSP). However, in the real-life applications, the scalarization method considered is highly important in terms of theoretical research and practical application because the FJCSP process is not easy because of many conflicting objectives. The proposed mixed integer non-linear model can be used for solving small and middle scaled problems. Solution of large scaled problems is not possible in reasonable time or takes too long time, so a Genetic Algorithm (GA) meta-heuristic approach that uses a multi-objective mathematical model with conic scalarization has been presented. An experimental design was used to determine the best combination of parameters which are affected performance of genetic algorithm to achieve optimum or sub-optimum solution. In this thesis study, a case study was conducted in Tülomsaş Locomotive and Engine Factory in Eskişehir. This study was solved by using both conic scalarization GA approach and weighted sum scalarization GA approach with six different weights of objective. It is emphasized that the multi-objective conic scalarization GA approach has better quality than other approach for five different weights of objective. In addition, it has been shown that the multi-objective model could also obtain optimum results in reasonable time for the real-world problems

Operational research:methods and applications

Throughout its history, Operational Research has evolved to include a variety of methods, models and algorithms that have been applied to a diverse and wide range of contexts. This encyclopedic article consists of two main sections: methods and applications. The first aims to summarise the up-to-date knowledge and provide an overview of the state-of-the-art methods and key developments in the various subdomains of the field. The second offers a wide-ranging list of areas where Operational Research has been applied. The article is meant to be read in a nonlinear fashion. It should be used as a point of reference or first-port-of-call for a diverse pool of readers: academics, researchers, students, and practitioners. The entries within the methods and applications sections are presented in alphabetical order