زمانبندی و تعیین اندازه انباشته هم زمان در محیط جریان کارگاهی انعطاف پذیر با در نظر گرفتن محدودیت های بافر بین ایستگاه های کاری و بافر عمومی

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

نویسندگان

1 دانش‌آموخته کارشناسی مهندسی صنایع، دانشکده مهندسی، دانشگاه کاشان، کاشان، ایران

2 استادیار، گروه مهندسی صنایع، دانشکده مهندسی، دانشگاه کاشان، کاشان، ایران

چکیده

به دلیل جایگاه ویژه زمان‌بندی و تعیین اندازه انباشته سیستم‌های جریان کارگاهی در مراکز تولیدی، این مسائل در سال‌های اخیر بسیار مورد توجه واقع شده‌اند. در محیط‌های صنعتی واقعی ممکن است ظرفیت بافر بین دو ایستگاه متوالی با توجه به ابعاد فیزیکی محصولات و کمبود فضا محدود باشد. محدود بودن ظرفیت بافر ممکن است سبب بلوکه کردن شود. با توجه به اهمیت این موضوع، در تحقیق حاضر مسئله زمان‌بندی و تعیین اندازه انباشته هم‌زمان جریان کارگاهی انعطاف‌پذیر با محدودیت های بافر بین ایستگاه های کاری و بافر عمومی بررسی شده است که به صورت چند دوره‌ای و چند محصولی بوده و ظرفیت ماشین ها نیز محدود می باشد. همچنین از بین بافرها، بافرهای میانی برای پر شدن اولویت بالاتری نسبت به بافر عمومی دارند. برای مسئله مورد بحث یک مدل برنامه‌ریزی غیرخطی عدد صحیح مختلط ارائه گردیده است. در این مدل هدف، کمینه‌سازی هزینه‌های تولید، نگهداری و تأمین خارجی می باشد. برای حل مدل از نرم افزار گمز استفاده شده است. با توجه به پیچیدگی مدل و NP-hard بودن مسئله مورد بررسی، جهت حل مسائل با ابعاد بزرگ الگوریتم فراابتکاری کلونی زنبور عسل مصنوعی گسسته ترکیبی پیشنهاد شده است. به منظور ارزیابی عملکرد الگوریتم پیشنهادی، به حل مسائل نمونه عددی در اندازه‌های مختلف با استفاده از این الگوریتم، نرم افزار گمز⸲ الگوریتم ژنتیک و همچنین ترکیب الگوریتم شبکه عصبی هاپفیلد با الگوریتم بازپخت شبیه‌سازی شده پرداخته شده است. نتایج محاسباتی، موید کارایی بسیار خوب الگوریتم مذکور برای حل مسئله مورد بررسی می‌باشد.

کلیدواژه‌ها

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

Concurrent scheduling and lot sizing in a flexible flow shop environment considering intermediate and public buffers

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

  • fatemeh mohaymeni 1
  • Somaye ghandi bidgoli 2
1 Industrial Engineering, Faculty of Engineering, University of Kashan, Kashan, Iran
2 Assistant Professor, Department of Industrial Engineering, Faculty of Engineering, Kashan University, Kashan, Iran
چکیده [English]

Due to the special position of the scheduling and lot sizing of flow shop scheduling systems in production centers, these issues have received a lot of attention in recent years. One common assumption in these cases is unlimited buffer capacity between different workstations. In industrial environments, the buffer capacity may be limited due to the physical dimensions of the products and the lack of space. Due to the importance of this issue, in the present study the concurrent scheduling and lot sizing of the flexible flow shop scheduling problem considering buffer constraints between workstations and public buffer is investigated which is multi-period and multi-product and the capacity of the machines is also limited. Also, among the buffers, middle buffers have a higher priority to be filled than the public buffer. For the mentioned problem, a Mixed Integer Non Linear Programing (MINLP) model is presented. The objective of this model is to minimize the production, maintenance and external supply costs. The GAMS software is used to solve the model. Due to the complexity of the model and the NP- hardness of the proposed problem, the Hybrid Discrete Artificial Bee Colony (HDABC) is proposed to solve large-scale problems. In order to evaluate the performance of the proposed algorithm, numerical sample problems in different sizes are solved using this algorithm, the GAMS software as well as the genetic algorithm and the Simulated Annealing Algorithm-based Hopfield Neural Network algorithm algorithm. Computational results demonstrate the effectiveness of the proposed algorithm for the considered problem.

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

  • Concurrent scheduling and lot sizing
  • Flexible flow Shop Scheduling (FFSS)
  • intermediate buffers
  • public buffer
  • Hybrid Discrete Artificial Bee Colony (HDABC)

مراجع

[۱] Johnson, S.M., Optimal two‐and three‐stage production schedules with setup times included. Naval research logistics quarterly, 1954. 1(1): p. 61-68.
[۲] Nawaz, M., E.E. Enscore Jr, and I. Ham, A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega, 1983. 11(1): p. 91-95.
[۳] Abdel-Basset, M., et al., A hybrid whale optimization algorithm based on local search strategy for the permutation flow shop scheduling problem. Future Generation Computer Systems, 2018. 85.
[۴] Olfat, L., Total Tardiness Minimization in Flow Shop with Intermediate Due Dates, Modern Researches in Decision Making, 2017, 2(3): p. 25-47.
[۵] Lian, Z., X. Gu, and B. Jiao, A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan. Chaos, Solitons & Fractals, 2008. 35(5): p. 851-861.
[۶] Arthanary, T., An extension of two machine sequencing problem. Opsearch, 1971. 8: p. 10-22.
[۷] Lee, T. and Y. Loong, A review of scheduling problem and resolution methods in flexible flow shop. International Journal of Industrial Engineering Computations, 2019. 10(1): p. 67-88.
[۸] Fandel, G. and C. Stammen-Hegene, Simultaneous lot sizing and scheduling for multi-product multi-level production. International Journal of Production Economics, 2006. 104(2): p. 308-316.
[۹] Mohammadi, M., et al., Rolling-horizon and fix-and-relax heuristics for the multi-product multi-level capacitated lotsizing problem with sequence-dependent setups. Journal of Intelligent Manufacturing, 2010. 21(4): p. 501-510.
[۱۰] Babaei, M., M. Mohammadi, and S. Ghomi, A genetic algorithm for the simultaneous lot sizing and scheduling problem in capacitated flow shop with complex setups and backlogging. The International Journal of Advanced Manufacturing Technology, 2014. 70(1): p. 125-134.
[۱۱] Ramezanian, R., M. Saidi-Mehrabad, and E. Teimoury, A mathematical model for integrating lot-sizing and scheduling problem in capacitated flow shop environments. The International Journal of Advanced Manufacturing Technology, 2013. 66(1): p. 347-361.
[۱۲] Alaghebandha, M., et al., Modeling of Scheduling and Economic Lot Sizing In Distributed Permutation Flow Shops with Non-Identical Multi Factory, Modern Researches in Decision Making, 2018, 3(3): p. 129-155. 
[۱۳] Badri, H.M., N.K. Khamis, and M.J. Ghazali, Integration of lot sizing and scheduling models to minimize production cost and time in the automotive industry. International Journal of Industrial Optimization, 2020. 1(1): p. 1-14.
[۱۴] Abdullah, S., A. Shamayleh, and M. Ndiaye. Capacitated lot-sizing and scheduling with sequence-dependent setups in petrochemical plants. in Proceedings of the 2016 International Conference on Industrial Engineering and Operations Management, Kuala Lumpur, Malaysia. 2016.
[۱۵] Mirnajafizadeh, S.M. and M. Bijari, Robust simultaneous lot-sizing and scheduling with considering controllable processing time and fixed carbon emission in flow-shop environment. International Journal of Industrial and Systems Engineering, 2022. 40(3): p. 343-369.
[۱۶] Copil, K., et al., Simultaneous lotsizing and scheduling problems: a classification and review of models. OR spectrum, 2017. 39(1): p. 1-64.
[۱۷] Li, J.-q. and Q.-k. Pan, Solving the large-scale hybrid flow shop scheduling problem with limited buffers by a hybrid artificial bee colony algorithm. Information Sciences, 2015. 3(16): p. 487-502.
[۱۸] Xiang, L., Y. Ai-ling, and Z. Hui-yu. Buffer allocation optimization for flexible flow shop. in 2016 IEEE Information Technology, Networking, Electronic and Automation Control Conference. 2016. 
[۱۹] Han, Z., et al., Hybrid flow shop scheduling with finite buffers. International Journal of Simulation and Process Modelling, 2018. 13(2): p. 156-166.
[۲۰] Lin, S., et al. Research on buffer dynamic capacity-increase scheduling method in flexible flow shop based on public buffer. in  10th International Conference on Modelling, Identification and Control (ICMIC). 2018.
[۲۱] Han, Z., et al., Flexible flow shop scheduling method with public buffer. Processes, 2019. 7(10): p. 681.
[۲۲] Fllah Sanami, S., et al, Concurrent scheduling and lot sizing in a flexible flow shop environment considering limited resources, Advances in Industrial Engineering, 2016. 17(50): p. 295-310. 
[۲۳] Sang, H., L. Gao, and Q. Pan, Discrete artificial bee colony algorithm for lot-streaming flowshop with total flowtime minimization. Chinese journal of mechanical engineering, 2012. 25(5): p. 990-1000.
[۲۴] Karaboga, D., An idea based on honey bee swarm for numerical optimization. 2005, Technical report-tr06, Erciyes university, engineering faculty, computer .
[۲۵] Wang, L., Q.-K. Pan, and M.F. Tasgetiren, Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms. Expert Systems with Applications, 2010. 37(12): p. 7929-7936.
[۲۶] Deng, G., H. Yang, and S. Zhang, An enhanced discrete artificial bee colony algorithm to minimize the total flow time in permutation flow shop scheduling with limited buffers. Mathematical Problems in Engineering, 2016. 
[۲۷] Cui, Z. and X. Gu, An improved discrete artificial bee colony algorithm to minimize the makespan on hybrid flow shop problems. Neurocomputing, 2015. 148: p. 248-259.
[۲۸] Ghandi Bidgoli, S. and Karimi, F., A Simulation-Based Optimization Approach for Mixed model Two-sided Assembly Line Balancing with stochastic task times (Case Study: Beh Afarinan Datis Tiva Company), Journal of Industrial Engineering Research in Production Systems, 2020, 8(16): p. 199-213. 
[۲۹] Ramezanian, R., M. Saidi-Mehrabad, and P. Fattahi, Integrated lot-sizing and scheduling with overlapping for multi-level capacitated production system. International Journal of Computer Integrated Manufacturing, 2013. 26(7): p. 681-695.
 
پژوهش های نوین در تصمیم گیری
دوره 8، شماره 1
اردیبهشت 1402
صفحه 114-144

فایل ها

هم رسانی

ارجاع به این مقاله

آمار