The Problem of Uninterrupted Hybrid Flow Shop Scheduling with Regard to the Fuzzy Processing Time
DOI:
https://doi.org/10.52547/ijimes.1.1.94DOR:
https://dorl.net/dor/20.1001.1.27832678.2021.1.1.7.7Keywords:
Uncertainty, Fuzzy Planning Method, Hybrid Flow Shop SchedulingAbstract
Purpose: In this paper, an uninterrupted hybrid flow shop scheduling problem is modeled under uncertainty conditions. Due to the uncertainty of processing time in workshops, which is due to delays in receiving raw materials or machine failure, fuzzy programming method has been used to control the processing time parameter. In the proposed model, there are several jobs that must be processed by machines in sequence. The main purpose of the proposed model is to determine the correct sequence of operations and assign operations to each machine at each stage, so that the total completion time (Cmax) is minimized.
Methodology: In this paper, the fuzzy programming method is used to control the uncertain parameter. Also, The GAMS software and CPLEX solver have also been used to solve the sample problems.
Findings: The results of solving the problem in small and medium size show that with increasing the rate of uncertainty, the amount of processing time increases and therefore the completion time of the whole work increases. On the other hand, with the increase in the number of machines in each stage due to the high efficiency of the machines, the completion time of all works has decreased.
Originality/Value: The most important innovation of this article is the design of uninterrupted hybrid flow shop scheduling with regard to the fuzzy processing time.
Downloads
References
Nouri, F., Samadzad, S., & Nahr, J. (2019). Meta-heuristics algorithm for two-machine no-wait flow-shop scheduling problem with the effects of learning. Uncertain Supply Chain Management, 7(4), 599-618. doi: 10.5267/j.uscm.2019.5.002
Pan, Q. K., Tasgetiren, M. F., Suganthan, P. N., & Chua, T. J. (2011). A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Information sciences, 181(12), 2455-2468. doi: https://doi.org/10.1016/j.ins.2009.12.025
Ghahremani-Nahr, J., Nozari, H., & Najafi, S. E. (2020). Design a green closed loop supply chain network by considering discount under uncertainty. Journal of Applied Research on Industrial Engineering, 7(3), 238-266. doi: 10.22105/jarie.2020.251240.1198
Aggoune, R. (2004). Minimizing the makespan for the flow shop scheduling problem with availability constraints. European Journal of Operational Research, 153(3), 534-543. doi: https://doi.org/10.1016/S0377-2217(03)00261-3
Ghahremani-Nahr, J., Nozari, H., & Bathaee, M. (2021). Robust Box Approach for Blood Supply Chain Network Design under Uncertainty: Hybrid Moth-Flame Optimization and Genetic Algorithm. International Journal of Innovation in Engineering, 1(2), 40-62.
Komaki, G. M., & Kayvanfar, V. (2015). Grey Wolf Optimizer algorithm for the two-stage assembly flow shop scheduling problem with release time. Journal of Computational Science, 8, 109-120. doi: https://doi.org/10.1016/j.jocs.2015.03.011
Arthanary, T. S. (1971). An extension of two machine sequencing problem. Opsearch, 8, 10-22.
Portmann, M. C., Vignier, A., Dardilhac, D., & Dezalay, D. (1998). Branch and bound crossed with GA to solve hybrid flow shops. European Journal of Operational Research, 107(2), 389-400. doi: https://doi.org/10.1016/S0377-2217(97)00333-0
Gholami, M., Zandieh, M., & Alem-Tabriz, A. (2009). Scheduling hybrid flow shop with sequence-dependent setup times and machines with random breakdowns. The International Journal of Advanced Manufacturing Technology, 42(1-2), 189-201. doi: 10.1007/s00170-008-1577-3
Naderi, B., Gohari, S., & Yazdani, M. (2014). Hybrid flexible flow shop problems: Models and solution methods. Applied Mathematical Modelling, 38(24), 5767-5780. doi: https://doi.org/10.1016/j.apm.2014.04.012
Lin, J. T., & Chen, C. M. (2015). Simulation optimization approach for hybrid flow shop scheduling problem in semiconductor back-end manufacturing. Simulation Modelling Practice and Theory, 51, 100-114. doi: https://doi.org/10.1016/j.simpat.2014.10.008
Dios, M., Fernandez-Viagas, V., & Framinan, J. M. (2018). Efficient heuristics for the hybrid flow shop scheduling problem with missing operations. Computers & Industrial Engineering, 115, 88-99. doi: https://doi.org/10.1016/j.cie.2017.10.034
Li, Z., Zhong, R. Y., Barenji, A. V., Liu, J. J., Yu, C. X., & Huang, G. Q. (2019). Bi-objective hybrid flow shop scheduling with common due date. Operational Research, 1-26. doi: https://doi.org/10.1007/s11590-019-01462-5
Sun, Y., Zhang, C., Gao, L., & Wang, X. (2011). Multi-objective optimization algorithms for flow shop scheduling problem: a review and prospects. The International Journal of Advanced Manufacturing Technology, 55(5-8), 723-739. doi: 10.1007/s00170-010-3094-4
Engin, O., & Güçlü, A. (2018). A new hybrid ant colony optimization algorithm for solving the no-wait flow shop scheduling problems. Applied Soft Computing, 72, 166-176. doi: https://doi.org/10.1016/j.asoc.2018.08.002
Ribas, I., Leisten, R., & Framiñan, J. M. (2010). Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. Computers & Operations Research, 37(8), 1439-1454. doi: https://doi.org/10.1016/j.cor.2009.11.001
Zheng, X., Wang, L., & Wang, S. (2014). A hybrid discrete fruit fly optimization algorithm for solving permutation flow-shop scheduling problem. Control Theory & Applications, 31(2), 159-164.
Davendra, D., & Bialic-Davendra, M. (2013). Scheduling flow shops with blocking using a discrete self-organising migrating algorithm. International Journal of Production Research, 51(8), 2200-2218. doi: https://doi.org/10.1080/00207543.2012.711968
Wang, C., Liu, C., Hu, D., Gong, W., & Shang, W. (2012). Research on waiting time optimization problem of hybrid flow-shop. Journal of Shenyang Jianzhu University (Natural Science), 28(2), 368-374.
Zhang, B., Pan, Q. K., Gao, L., Zhang, X. L., Sang, H. Y., & Li, J. Q. (2017). An effective modified migrating birds optimization for hybrid flow shop scheduling problem with lot streaming. Applied Soft Computing, 52, 14-27. doi: https://doi.org/10.1016/j.asoc.2016.12.021
Komaki, G. M., Teymourian, E., & Kayvanfar, V. (2016). Minimising makespan in the two-stage assembly hybrid flow shop scheduling problem using artificial immune systems. International Journal of Production Research, 54(4), 963-983. doi: https://doi.org/10.1080/00207543.2015.1035815
Chamnanlor, C., Sethanan, K., Gen, M., & Chien, C. F. (2017). Embedding ant system in genetic algorithm for re-entrant hybrid flow shop scheduling problems with time window constraints. Journal of Intelligent Manufacturing, 28(8), 1915-1931. doi: https://doi.org/10.1007/s10845-015-1078-9
Lu, C., Gao, L., Pan, Q., Li, X., & Zheng, J. (2019). A multi-objective cellular grey wolf optimizer for hybrid flow shop scheduling problem considering noise pollution. Applied Soft Computing, 75, 728-749. doi: https://doi.org/10.1016/j.asoc.2018.11.043
Qin, W., Zhang, J., & Song, D. (2018). An improved ant colony algorithm for dynamic hybrid flow shop scheduling with uncertain processing time. Journal of Intelligent Manufacturing, 29(4), 891-904. doi: https://doi.org/10.1007/s10845-015-1144-3
Shao, W., Shao, Z., & Pi, D. (2020). Modeling and multi-neighborhood iterated greedy algorithm for distributed hybrid flow shop scheduling problem. Knowledge-Based Systems, 105527. doi: https://doi.org/10.1016/j.knosys.2020.105527
Alfaro-Fernández, P., Ruiz, R., Pagnozzi, F., & Stützle, T. (2020). Automatic Algorithm Design for Hybrid Flow shop Scheduling Problems. European Journal of Operational Research, 282(3), 835-845. doi: https://doi.org/10.1016/j.ejor.2019.10.004
Li, Y., Li, X., Gao, L., Zhang, B., Pan, Q. K., Tasgetiren, M. F., & Meng, L. (2021). A discrete artificial bee colony algorithm for distributed hybrid flow shop scheduling problem with sequence-dependent setup times. International Journal of Production Research, 59(13), 3880-3899. doi: https://doi.org/10.1080/00207543.2020.1753897
Shao, W., Shao, Z., & Pi, D. (2021). Multi-objective evolutionary algorithm based on multiple neighborhoods local search for multi-objective distributed hybrid flow shop scheduling problem. Expert Systems with Applications, 115453. doi: https://doi.org/10.1016/j.eswa.2021.115453
Published
How to Cite
Issue
Section
License
Copyright (c) 2021 Ramez Kian
This work is licensed under a Creative Commons Attribution 4.0 International License.
Publisher
