نوع مقاله : مقاله پژوهشی

نویسندگان

1 کارشناس ارشد مدیریت صنعتی، دانشکده مدیریت و حسابداری ، دانشگاه علامه طباطبایی، تهران، ایران

2 دانشیار دانشکده مهندسی صنایع و مکانیک، واحد قزوین، دانشگاه آزاد اسلامی، قزوین، ایران

3 استاد دانشکده مدیریت و حسابداری، دانشگاه علامه طباطبائی، تهران، ایران

چکیده

این مطالعه، به بررسی خطوط تولید چند محصولی نامطمئن با چیدمان ترکیبی (سری-موازی) با احتمال خرابی ماشین‌آلات در هر ایستگاه کاری می‌پردازد. هدف از این پژوهش، توسعه یک مدل ریاضی چند‌هدفه شامل بیشینه‌سازی نرخ تولید و کمینه‌سازی هزینه‌های ناشی از کاهش زمان پردازش ایستگاه‌های کاری و هم‌چنین حجم کل بافرها، با توجه به مقادیر بهینه میانگین زمان پردازش هر محصول در هر ایستگاه و حجم بافر میان ایستگاه های کاری می‌باشد. بدین منظور جهت پیکره‌بندی ساختار مدل ریاضی از تکنیک‌هایی نظیر شبیه‌سازی، طراحی آزمایشات و رویه سطح پاسخ و جهت حل آن از الگوریتم‌های فرا ابتکاری ژنتیک مرتب‌سازی نامغلوب(NSGA-II) و ژنتیک رتبه‌بندی نامغلوب(NRGA) استفاده شده است. اعتبار مدل ریاضی چند هدفه و کاربرد متدولوژی پیشنهادی حل مدل، در یک مطالعه موردی بررسی گردیده‌است. درنهایت، عملکرد الگوریتم‌های به‌ کارگرفته‌شده در تحقیق حاضر مورد ارزیابی قرار گرفته‌است. نتایج نشان می دهد مدل ریاضی چند هدفه پیشنهادی جهت بهینه سازی خطوط تولید نامطمئن معتبر بوده و توانایی دستیابی به نقاط بهینه (نزدیک به بهینه) در سایر مسائل مشابه با ابعاد بزرگ تر و پیچیدگی بیشتر را دارا می باشد.

کلیدواژه‌ها

عنوان مقاله [English]

An Optimization of Multi-product Assembly Lines Using Simulation and Multi-Objective Programming Approach

نویسندگان [English]

  • maedeh mosayeb motlagh 1
  • Parham Azimi 2
  • maghsoud Amiri 3

1 M.S. Graduate student, Department of Industrial Management, School of Management and Accounting, Allameh Tabatabae’i University, Tehran, Iran

2 Associate Professor, Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran

3 Professor, School of Management and Accounting, Allameh Tabatabai University, Tehran, Iran

چکیده [English]

This paper investigates unreliable multi-product assembly lines with mixed (serial-parallel) layout model in which machines failures and repairing probabilities are considered. The aim of this study is to develop a multi-objective mathematical model consisting the maximization of the throughput rate of the system and the minimization of the total cost of reducing mean processing times and the total buffer capacities with respect to the optimal values of the mean processing time of each product in each workstation and the buffer capacity between workstations. For this purpose, in order to configure the structure of the mathematical model, Simulation, Design of Experiments and Response Surface Methodology are used and to solve it, the meta-heuristic algorithms including Non-Dominated Sorting Genetic Algorithm II (NSGA-II) and Non-Dominated Ranked Genetic Algorithm (NRGA) are implemented. The validity of the multi-objective mathematical model and the application of the proposed methodology for solving the model is examined on a case study. Finally, the performance of the algorithms used in this study is evaluated. The results show that the proposed multi-objective mathematical model is valid for optimizing unreliable production lines and has the ability to achieve optimal (near optimal) solutions in other similar problems with larger scale and more complexity.
Introduction
A production line consists of a sequence of workstations, in each of which parts are processed by machines. In this setup, each workstation includes a number of similar or dissimilar parallel machines, and a buffer is placed between any two consecutive workstations. In production lines, the buffer capacity and processing time of machinery have a significant impact on the system's performance. The presence of buffers helps the system to maintain production despite possible conditions or accidents, such as machinery failure or changes in processing time. Previous research has investigated production lines without any possibility of machinery failure, referred to as "safe production lines." However, in real production lines, machinery failure is inevitable. Therefore, several studies have focused on "uncertain production lines,"assuming the existence of a probability of failure in a deterministic or exponential distribution. This research examines uncertain production lines with a combined layout, resulting from the combination of parallel deployment of machines within each workstation, if necessary, and serial deployment of workstations. The objective of this research is to determine the optimal values (or values close to optimal) of the average processing time of each product in each workstation, as well as the volume of buffers, as decision variables. The approach aims to maximize the system's output while minimizing the costs associated with reducing the processing time of workstations and minimizing the total volume of buffers between stations. Moreover, simulation can be applied without interrupting the production line or consuming significant resources. In this research, due to the high cost and time involved, implementing the proposed changes on the system is not cost-effective for investigating the changes in the production system's output rate. Therefore, the simulation technique has been utilized to optimize the production line.
Research method
The present study aims to develop a multi-objective mathematical model, based on simulation, to optimize multi-product production lines. In the first step, the structure of the multi-objective mathematical model is defined, along with the basic assumptions. To adopt a realistic approach in the model structure, the simulation technique has been employed to address the first objective function, which is maximizing the output rate of the production line. To achieve this, the desired production system is simulated. The design of experiments is used to generate scenarios for implementation in the simulated model, and the response surface methodology is utilized to analyze the relationship between the input variables (such as the average processing time of each product type in each workstation and the buffer volume between stations) and the response variable (production rate).
Results
To implement the proposed methodology based on the designed multi-objective programming model, a case study of a three-product production line with 9 workstations and 8 buffers was conducted. Subsequently, to compare the performance of the optimization algorithms, five indicators were used: distance from the ideal solution, maximum dispersion, access rate, spacing, and time. For this purpose, 30 random problems, similar to the mathematical model of the case study, were generated and solved. Based on the results obtained, both algorithms exhibited similar performance in all indices, except for the maximum dispersion index.
Conclusions
In this article, the structure of a multi-objective mathematical model was sought in uncertain multi-product production lines with the combined arrangement of machines in series-parallel (parallel installation of machines in workstations if needed and installation of workstations in series). The objective was to determine the optimal values of the average processing time of each type of product in each workstation and the buffer volume of each station, with the goals of maximizing the production rate, minimizing the costs resulting from reducing the processing time, and the total volume of inter-station buffers simultaneously. To investigate the changes in the output rate of the production system, due to the high cost and time, it was deemed not cost-effective to implement the proposed changes on the system. Therefore, the combination of simulation techniques, design of experiments, and response surface methodology was used to fit the relevant metamodel. In the proposed approach of this research, taking a realistic view of production line modeling, the probability of machinery failure, as well as the possibility of repairability and return to the system, were considered in the form of statistical distribution functions. Additionally, all time parameters, including the arrival time between the parts, the start-up time of all the machines, the processing time, the time between two failures, and the repair time of the machines, were non-deterministic and subject to statistical distributions. Finally, to solve the structured mathematical model, two meta-heuristic algorithms (NSGA-II) and (NRGA) were considered.

کلیدواژه‌ها [English]

  • Unreliable Assembly lines
  • Multi-Objective Optimization
  • Simulation
  • Design of Experiments
  • Response Surface Methodology
  1. Abdul‐Kader, W., Ganjavi, O., & Baki, F. (2011). A nonlinear model for optimizing the performance of a multi‐product production line. International Transactions in Operational Research, 18(5), 561-577.
  2. Alon, G., Kroese, D. P., Raviv, T., & Rubinstein, R. Y. (2005). Application of the cross-entropy method to the buffer allocation problem in a simulation-based environment. Annals of Operations Research, 134(1), 137-151.
  3. Altiparmak, F., Dengiz, B., & Bulgak, A. A. (2007). Buffer allocation and performance modeling in asynchronous assembly system operations: An artificial neural network metamodeling approach. Applied Soft Computing, 7(3), 946-956.
  4. Amiri, M., & Mohtashami, A. (2012). Buffer allocation in unreliable production lines based on design of experiments, simulation, and genetic algorithm. The International Journal of Advanced Manufacturing Technology, 62(1-4), 371-383.
  5. Aydilek, H., & Allahverdi, A. (2013). A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times. Applied Mathematical Modelling, 37(12), 7164-7173.
  6. Banks, J., Carson II, J. S., Automation, B., Nelson, B. L., & Nicol, D. M. (2005) Discrete-Event System Simulation FOURTH EDITION.
  7. Bekker, J. (2013). Multi-objective buffer space allocation with the cross-entropy method. International Journal of Simulation Modelling, 12(1), 50–61.
  8. Chehade, H., Yalaoui, F., Amodeo, L., & Dugardin, F. (2010, October). Buffers sizing in assembly lines using a Lorenz multiobjective ant colony optimization algorithm. In Machine and Web Intelligence (ICMWI), 2010 International Conference on (pp. 283-287). IEEE.
  9. Chung, C. A. (2000). Simulation modeling handbook: a practical approach.
  10. Deb, K. (2001). Multi-objective optimization using evolutionary algorithms (Vol. 16). John Wiley & Sons.
  11. Demir, L., Tunalı, S., Eliiyi, D. T., & Løkketangen, A. (2013). Two approaches for solving the buffer allocation problem in unreliable production lines. Computers & Operations Research, 40(10), 2556-2563.
  12. Diamantidis, A.C., Papadopoulos, C.T. (2009). Exact analysis of a two-station onebuffer flow line with parallel unreliable machines. European Journal of Operational Research 197, 572–580.
  13. Fallah-Jamshidi, S., Amiri, M., & Karimi, N. (2010). Nonlinear continuous multi-response problems: a novel two-phase hybrid genetic based metaheuristic. Applied Soft Computing, 10(4), 1274-1283.
  14. Ferreira, S. C., Bruns, R. E., Ferreira, H. S., Matos, G. D., David, J. M., Brandao, G. C., da Silva, E.P., Portugal L.A., Dos Reis P.S., Souza A.S., & Dos Santos, W. N. L. (2007). Box-Behnken design: an alternative for the optimization of analytical methods. Analytica chimica acta, 597(2), 179-186.
  15. Gurel, S., & Akturk, M. S. (2007). Optimal allocation and processing time decisions on non-identical parallel CNC machines: ϵ-constraint approach. European Journal of Operational Research, 183(2), 591-607.
  16. Han, M. S., & Park, D. J. (2002). Optimal buffer allocation of serial production lines with quality inspection machines. Computers & Industrial Engineering, 42(1), 75-89.
  17. Hsieh, S. J. T. (2002). Hybrid analytic and simulation models for assembly line design and production planning. Simulation Modelling Practice and Theory, 10(1-2), 87-108.
  18. Hsieh, P. H., Yang, S. J., & Yang, D. L. (2015). Decision support for unrelated parallel machine scheduling with discrete controllable processing times. Applied Soft Computing, 30, 475-483.
  19. Huang, M. G., Chang, P. L., & Chou, Y. C. (2002). Buffer allocation in flow-shop-type production systems with general arrival and service patterns. Computers & Operations Research, 29(2), 103-121.
  20. Karimi, N., Zandieh, M., & Karamooz, H. R. (2010). Bi-objective group scheduling in hybrid flexible flowshop: a multi-phase approach. Expert Systems with Applications, 37(6), 4024-4032.
  21. Kim, S., & Lee, H. J. (2001). Allocation of buffer capacity to minimize average work-in-process. Production Planning & Control, 12(7), 706-716.
  22. Kolb, O., & Göttlich, S. (2015). A continuous buffer allocation model using stochastic processes. European Journal of Operational Research, 242(3), 865-874.
  23. Kose, S. Y., & Kilincci, O. (2015). Hybrid approach for buffer allocation in open serial production lines. Computers & Operations Research, 60, 67-78.
  24. Llerena, A. Malavasi, B. (2013). Hypothesis Test of a New Line Balancing Approach with Dynamic Allocation of Assembly Operation. University of Skovde, Bachelor Degree Projection.
  25. Lu, C., Xiao, S., Li, X., & Gao, L. (2016). An effective multi-objective discrete grey wolf optimizer for a real-world scheduling problem in welding production. Advances in Engineering Software, 99, 161-176.
  26. MacGregor Smith, J., & Cruz, F. R. B. (2005). The buffer allocation problem for general finite buffer queueing networks. Iie Transactions, 37(4), 343-365.
  27. Massim, Y., Yalaoui, F., Amodeo, L., Châtelet, É., & Zeblah, A. (2010). Efficient combined immune-decomposition algorithm for optimal buffer allocation in production lines for throughput and profit maximization. Computers & Operations Research, 37(4), 611-620.
  28. Mohammadi, S., Monfared, M. A. S., & Bashiri, M. (2017). An improved evolutionary algorithm for handling many-objective optimization problems. Applied Soft Computing, 52, 1239-1252.
  29. Mohtashami, A. (2014). A new hybrid method for buffer sizing and machine allocation in unreliable production and assembly lines with general distribution time-dependent parameters. The International Journal of Advanced Manufacturing Technology, 74(9-12), 1577-1593.
  30. Mor, B., & Mosheiov, G. (2014). Batch scheduling of identical jobs with controllable processing times. Computers & Operations Research, 41, 115-124.
  31. Nahas, N., Ait-Kadi, D., & Nourelfath, M. (2006). A new approach for buffer allocation in unreliable production lines. International journal of production economics, 103(2), 873-881.
  32. Oesterle, J., Bauernhansl, T., & Amodeo, L. (2016). Hybrid multi-objective optimization method for solving simultaneously the line balancing, equipment and buffer sizing problems for hybrid assembly systems. Procedia CIRP, 57, 416-421.
  33. Raman, N. A., & Jamaludin, E. K. R. (2008). Implementation of Toyota Production System (TPS) in the production line of a local automotive parts manufacturer. In Proceedings of International Conference on Mechanical, Manufacturing Engineering.
  34. Sabuncuoglu, I., Erel, E., & Gocgun, Y. (2006). Analysis of serial production lines: characterisation study and a new heuristic procedure for optimal buffer allocation. International Journal of Production Research, 44(13), 2499-2523.
  35. Scott, J. R. (1995). Fault tolerant design using single and multi-criteria genetic algorithms. Master's thesis, Department of Aeronautics and Astronautics, Massachusetts Institute of Technology.
  36. Shi, C., & Gershwin, S. B. (2009). An efficient buffer design algorithm for production line profit maximization. International Journal of Production Economics, 122(2), 725-740.
  37. Smith, J. M., Cruz, F. R., & Van Woensel, T. (2010). Topological network design of general, finite, multi-server queueing networks. European Journal of Operational Research, 201(2), 427-441.
  38. So, K. C. (1997). Optimal buffer allocation strategy for minimizing work-in-process inventory in unpaced production lines. IIE transactions, 29(1), 81-88.
  39. Tiacci, L. (2015). Simultaneous balancing and buffer allocation decisions for the design of mixed-model assembly lines with parallel workstations and stochastic task times. International Journal of Production Economics, 162, 201-215.
  40. Troitiño Malavasi, B. M., & Muñoz Llerena, A. (2013). Hypothesis test of a new line balancing approach with dynamic allocation of assembly operations.
  41. Tsadiras, A. K., Papadopoulos, C. T., & O’Kelly, M. E. (2013). An artificial neural network based decision support system for solving the buffer allocation problem in reliable production lines. Computers & industrial engineering, 66(4), 1150-1162.
  42. Uruk, Z., Gultekin, H., & Akturk, M. S. (2013). Two-machine flowshop scheduling with flexible operations and controllable processing times. Computers & Operations Research, 40(2), 639-653.
  43. Yamashita, H., & Altiok, T. (1998). Buffer capacity allocation for a desired throughput in production lines. IIE transactions, 30(10), 883-892.
  44. Zandieh, M., Joreir-Ahmadi, M. N., & Fadaei-Rafsanjani, A. (2017). Buffer allocation problem and preventive maintenance planning in non-homogenous unreliable production lines. The International Journal of Advanced Manufacturing Technology, 91(5-8), 2581-2593.
  45. Zitzler, E. (1999). Evolutionary algorithms for multiobjective optimization: Methods and applications.