| تعداد نشریات | 31 |
| تعداد شمارهها | 854 |
| تعداد مقالات | 8,255 |
| تعداد مشاهده مقاله | 16,436,409 |
| تعداد دریافت فایل اصل مقاله | 10,878,740 |
A trapezoidal fuzzy flow shop scheduling framework integrating job block heuristics to reduce waiting time | ||
| Iranian Journal of Fuzzy Systems | ||
| مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 24 مرداد 1405 اصل مقاله (877.23 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22111/ijfs.2026.53655.9496 | ||
| نویسندگان | ||
| Bharat Goyal* 1؛ Deepak Gupta2؛ Rozy Rani3 | ||
| 1General Shivdev Singh Diwan Gurbachan Singh Khalsa College Patiala | ||
| 2Department of Mathematics, Maharishi Markandeshwar (Deemed to be University) Mullana | ||
| 3Chandigarh Group of Colleges Jhanjeri, Chandigarh Engineering College, Department of Applied Sciences, Mohali | ||
| چکیده | ||
| This study addresses a two-machine flow shop scheduling problem with uncertain processing durations represented as trapezoidal fuzzy numbers, which are converted to crisp values using Yager’s ranking index. Job-block formation is introduced to reduce sequencing complexity and suppress waiting on the second machine, and new theorems establish how block aggregation influences waiting-time behavior. A structured heuristic generates the sequence with minimum total waiting time of jobs. Extensive computational experiments on specially structured instances demonstrate consistent improvements in waiting time. Statistical analysis, including paired t-tests and Wilcoxon signed-rank tests, confirms that the proposed heuristic achieves significant reductions compared to classical rules and recent heuristics across multiple job sizes (p < 0.01), supporting the superiority of the method. The results highlight the practical effectiveness of integrating fuzzy modelling, crisp conversion, and block-based sequencing, providing a theoretically grounded and empirically validated approach for modern production environments with imprecise processing times. | ||
| کلیدواژهها | ||
| Trapezoidal؛ specially structured؛ flow shop scheduling؛ fuzzy processing time؛ job-block formation؛ waiting time minimization؛ heuristic | ||
| مراجع | ||
|
[1] V. Bhatnagar, G. Das, O. P. Mehta, n-job two machine flow-job shop scheduling problem having minimum total waiting time for all jobs, Pure and Applied Mathematics Sciences, 10(1-2) (1979), 1-10.
[2] N. Brauner, G. Finke, V. Lehoux-Lebacque, C. Potts, J. Whitehead, Scheduling of coupled tasks and one-machine no-wait robotic cells, Computers and Operations Research, 36(2) (2009), 301-307. https://doi.org/10.1016/j. cor.2007.10.003
[3] O. García-Gómez, I. González-Rodríguez, C. R. Vela, Computing idle times in fuzzy flexible job shop scheduling, Algorithms, 18(3) (2025), 137-150. https://doi.org/10.3390/a18030137
[4] B. Goyal, S. Kaur, Flow shop scheduling-especially structured models under fuzzy environment with optimal waiting time of jobs, International Journal of Design Engineering, 11(1) (2022), 47-60. https://dx.doi.org/10.1504/ IJDE.2022.127075
[5] B. Goyal, S. Kaur, Specially structured flow shop scheduling models with processing times as trapezoidal fuzzy numbers to optimize waiting time of jobs, Advances in Intelligent Systems and Computing: AISC, 1393(2) (2021), 27-42. https://doi.org/10.1007/978-981-16-2712-5_3
[6] B. Goyal, S. Kaur, Novel heuristic approach to minimize total waiting time of jobs in two-stage flow shop scheduling, Conference: 1ST International Conference on Advances in Material Science and Technology: ICAMST2022,2962 (2024) 1-9. https://doi.org/10.1063/5.0192154
[7] B. Goyal, S. Kaur, D. Gupta, A heuristic approach to minimizing the waiting time of jobs in two-stage flow shop scheduling, Operations Research and Decisions, 34(1) (2024), 175-191. https://doi.org/10.37190/ord240109
[8] B. Goyal, S. Kaur, D. Rani, Special structures in flowshop scheduling with separated set-up times and concept of job block: Minimization of waiting time of jobs, Advances in Mathematics: Scientific Journal, 9(7) (2020), 4607 4619.https://doi.org/10.37418/amsj.9.7.29
[9] B. Goyal, S. Kaur, Comparative performance analysis of heuristics with bi-criterion optimization for flow shop scheduling, Proceedings of Advances in Data-Driven Computing and Intelligent Systems, 698 (2023), 653-669. https://doi.org/10.1007/978-981-99-3250-4_50
[10] D. Gupta, P. Singla, S. Singla, Production problem with the conception of task (job) block criteria, Advances in Mathematics: Scientific Journal, 10(3) (2021), 1389-1396. https://doi.org/10.37418/amsj.10.3.27
[11] S. M. Johnson, Optimal two and three stage production schedules with setup times included, Naval Research Logistics Quarterly, 1(1) (1954), 61-68. https://doi.org/10.1002/nav.3800010110
[12] M. Khatami, A. Salehipour, Coupled task scheduling with time-dependent processing times, Journal of Scheduling, 24(2021), 223-236. https://doi.org/10.1007/s10951-020-00675-2
[13] M. Khatami, A. Salehipour, T. C. E. Chen, Flow-shop scheduling with exact delays to minimize makespan, Com puters and Industrial Engineering, 183 (2023), 1-8. https://doi.org/10.1016/j.cie.2023.109456
[14] D. Khorasanian, G. Moslehi, Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and pre-emption, Computers and Operations Research, 79 (2017), 94-108. https://doi.org/10. 1016/j.cor.2016.09.023
[15] Z. Liang, P. Zhong, M. Liu, C. Zhang, Z. Zhang, A computational efficient optimization of flow shop scheduling problems, Scientific Reports, 12 (2022), 1-14. https://doi.org/10.1038/s41598-022-04887-8
[16] P. L. Maggu, G. Dass, Equivalent jobs for job block in job sequencing, Operations Research, 14(4) (1977), 277-281.
[17] K. K. Nailwal, D. Gupta, K. Jeet, Heuristics for no-wait flow shop scheduling problem, International Journal of Industrial Engineering Computations, 7 (2016), 671-680. https://doi.org/10.5267/j.ijiec.2016.2.005
[18] M. Nawaz, E. E. Enscore, I. Ham, A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem, Omega, 11(1) (1983), 91-95. https://doi.org/10.1016/0305-0483(83)90088-9
[19] K. Ranjith, K. Karthikeyan, Minimizing the total waiting time for fuzzy two–machine flow shop scheduling problem with uncertain processing time, Baghdad Science Journal, 22(4) (2024), 1450-1462. https://doi.org/10.21123/ bsj.2024.10784
[20] S. Rahmativala, J. Ghahremani, A robust optimization method for hybrid flow shop scheduling with uncertain setup times, Decision Analytics Journal, 16 (2025), 1-18. https://doi.org/10.1016/j.dajour.2025.100609
[21] P. Sanja, S. Xueyan, A new approach to two-machine flow shop problem with uncertain processing times, Opti mization and Engineering, 7(3) (2006), 329-343. https://doi.org/10.1007/s11081-006-9975-6
[22] D. L. Yang, W. H. Kuo, Minimizing makespan in a two-machine flowshop problem with processing time linearly dependent on job waiting time, Sustainability, 11(24) (2019), 6885-6902.https://doi.org/10.3390/su11246885
[23] R. R. Yager, A procedure for ordering fuzzy subsets of the unit interval, Information Sciences, 24(2) (1981), 143-161. https://doi.org/10.1016/0020-0255(81)90017-7 | ||
|
آمار تعداد مشاهده مقاله: 3 |
||