BEKLEMESİZ ESNEK AKIŞ TİPİ ÇİZELGELEME PROBLEMİNDE BAKIM BAŞLAMA ZAMANLARININ BELİRLENMESİ: MAKİNE HIZLARININ ETKİSİ

Yıl 2025, Cilt: 36 Sayı: 2, 102 - 118, 31.08.2025

Feriştah Özçelik , Tuğba Saraç

Öz

Bu çalışmada, makine hızlarının iş bazında değişebildiği ve bakım başlama zamanlarının karar değişkeni olduğu beklemesiz esnek akış tipi çizelgeleme problemi ele alınmıştır. Ele alınan problem için bir matematiksel model geliştirilmiştir. Önerilen matematiksel modelin performansı, rassal türetilen test problemleri kullanılarak gösterilmiştir. Makine hız değişimlerinin dikkate alınmasının etkisini gösterebilmek amacıyla, önerilen matematiksel model ile elde edilen sonuçlar, hızların sabit ele alındığı durum ile karşılaştırılmış ve son işin tamamlanma zamanında ortalama %15 iyileşme sağlanmıştır.

Anahtar Kelimeler

Beklemesiz esnek akış tipi çizelgeleme , değişken makine hızları , bakım başlama zamanı

Kaynakça

• Abdollahpour, S. ve Rezaian, J. (2017). Two new meta-heuristics for no-wait flexible flow shop scheduling problem with capacitated machines, mixed make-to-order and make-to-stock policy. Soft Computing, 21, 3147-3165. Doi: https://doi.org/10.1007/s00500-016-2185-z
• Asefi, H., Jolai, F., Rabiee, M. ve Tayebi Araghi M. E. (2014). A hybrid NSGA-II and VNS for solving a bi-objective no-wait flexible flowshop scheduling problem. International Journal of Advanced Manufacturing Technology, 75, 1017–1033. Doi: https://doi.org/10.1007/s00170-014-6177-9
• Bouras, A., Masmoudi, M., Saadani, N. E. H., Bahroun, Z. ve Abdeljaouad, M. A. (2021). Multi-stage appointment scheduling for outpatient chemotherapy unit: a case study. RAIRO-operations Research, 55(2), 589-610. Doi: https://doi.org/10.1051/ro/2021025
• Carpov, S., Carlier, J., Nace, D. ve Sirdey, R. (2012). Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage. Computers & Operations Research, 39(3), 736-745. Doi: https://doi.org/10.1016/j.cor.2011.05.020
• Chen, K., Li, D. ve Wang, X. (2020). Makespan minimization in two-machine flow-shop scheduling under no-wait and deterministic unavailable interval constraints. Journal of Systems Science and Systems Engineering, 29, 400-411. Doi: https://doi.org/10.1007/s11518-020-5456-2
• Esmaelian, M., Mohammadi, M. ve Shahmoradi, H. (2023). New formulation for scheduling flexible flow shop problems. International Journal on Interactive Design and Manufacturing (IJIDeM), 17(6), 3305-3319. Doi: https://doi.org/10.1007/s12008-023-01414-5
• Espinouse, M-L, Formanowicz, P. ve Penz, B. (2001). Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability, Journal of the Operational Research Society, 52(1), 116-121. Doi: https://doi.org/10.1057/palgrave.jors.2601025
• Fang, K., Luo W. ve Che A. (2021). Speed scaling in two-machine lot-streaming flow shops with consistent sublots, Journal of the Operational Research Society, 72(11), 2429-2441. Doi: https://doi.org/10.1080/01605682.2020.1796533
• Huang, R. H., Yang, C. L. ve Liu, S. C. (2015). No‐Wait Flexible Flow Shop Scheduling with Due Windows. Mathematical Problems in Engineering, 2015(1), 456719. Doi: https://doi.org/10.1155/2015/456719
• Işık, E. E., Topaloglu Yildiz, S. ve Şatır Akpunar, Ö. (2023). Constraint programming models for the hybrid flow shop scheduling problem and its extensions. Soft Computing, 27(24), 18623-18650. Doi: https://doi.org/10.1007/s00500-023-09086-9
• Jafarzadeh, H., Moradinasab, N. ve Gerami, A. (2017). Solving no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines and rework time by the adjusted discrete Multi Objective Invasive Weed Optimization and fuzzy dominance approach. Journal of Industrial Engineering and Management (JIEM), 10(5), 887-918. Doi: https://doi.org/10.3926/jiem.2348
• Jolai, F., Rabiee, M. ve Asefi, H. (2012). A novel hybrid meta-heuristic algorithm for a no-wait flexible flow shop scheduling problem with sequence dependent setup times, International Journal of Production Research, 50(24), 7447-7466. Doi: https://doi.org/10.1080/00207543.2011.653012
• Jolai, F., Sheikh, S., Rabbani, M. ve Karimi, B. (2009). A genetic algorithm for solving no-wait flexible flow lines with due window and job rejection. The International Journal of Advanced Manufacturing Technology, 42, 523-532. Doi: https://doi.org/10.1007/s00170-008-1618-y
• Meng, L., Zhang, C., Shao, X., Zhang, B., Ren, Y. ve Lin, W. (2020). More MILP models for hybrid flow shop scheduling problem and its extended problems, International Journal of Production Research, 58(13), 3905-3930. Doi: https://doi.org/10.1080/00207543.2019.1636324
• Miyata, H. H., Nagano, M. S. ve Gupta, J. N. D. (2019a). Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study, Engineering Optimization, 51(4), 680-698. Doi: https://doi.org/10.1080/0305215X.2018.1485903
• Miyata, H. H., Nagano, M. S. ve Gupta, J. N. (2019b). Integrating preventive maintenance activities to the no-wait flow shop scheduling problem with dependent-sequence setup times and makespan minimization. Computers & Industrial Engineering, 135, 79-104. Doi: https://doi.org/10.1016/j.cie.2019.05.034
• Miyata, H. H. ve Nagano, M. S. (2021). Optimizing distributed no-wait flow shop scheduling problem with setup times and maintenance operations via iterated greedy algorithm. Journal of Manufacturing Systems, 61, 592-612. Doi: https://doi.org/10.1016/j.jmsy.2021.10.005
• Moradinasab, N., Shafaei, R., Rabiee, M. ve Ramezani, P. (2013). No-wait two stage hybrid flow shop scheduling with genetic and adaptive imperialist competitive algorithms, Journal of Experimental & Theoretical Artificial Intelligence, 25(2), 207-225. Doi: https://doi.org/10.1080/0952813X.2012.682752
• Qin, Y. ve Zhang, H. (2016). Elite particle swarm optimization algorithm for solving the bi-criteria no-wait flexible flow shop problem. International Journal of Grid and Distributed Computing, 9(12), 267-232. Doi: http://dx.doi.org/10.14257/ijgdc.2016.9.12.24
• Rabiee, M., Jolai, F., Asefi, H., Fattahi, P. ve Lim, S. (2016). A biogeography based optimisation algorithm for a realistic no-wait hybrid flow shop with unrelated parallel machines to minimise mean tardiness, International Journal of Computer Integrated Manufacturing, 29(9), 1007-1024. Doi: https://doi.org/10.1080/0951192X.2015.1130256
• Rabiee, M., Sadeghi Rad, R., Mazinani, M. ve Shafaei, R. (2014). An intelligent hybrid meta-heuristic for solving a case of no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines. The International Journal of Advanced Manufacturing Technology, 71, 1229-1245. Doi: https://doi.org/10.1007/s00170-013-5375-1
• Ramezani, P., Rabiee, M. ve Jolai, F. (2015). No-wait flexible flowshop with uniform parallel machines and sequence-dependent setup time: a hybrid meta-heuristic approach. Journal of Intelligent Manufacturing, 26, 731-744. Doi: https://doi.org/10.1007/s10845-013-0830-2
• Shafaei, R., Moradinasab, N. ve Rabiee, M. (2011a). Efficient meta heuristic algorithms to minimize mean flow time in no-wait two stage flow shops with parallel and identical machines, International Journal of Management Science and Engineering Management, 6(6), 421-430. Doi:https://doi.org/10.1080/17509653.2011.10671192
• Shafaei, R., Rabiee, M. ve Mirzaeyan, M. (2011b). An adaptive neuro fuzzy inference system for makespan estimation in multiprocessor no-wait two stage flow shop, International Journal of Computer Integrated Manufacturing, 24(10), 888-899. Doi: https://doi.org/10.1080/0951192X.2011.597430
• Shao, W., Shao, Z. ve Pi, D. (2021). Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem. Computers & Operations Research, 136, 105482. Doi: https://doi.org/10.1016/j.cor.2021.105482
• Singh, H., Oberoi, J. S. ve Singh, D. (2021). Multi-objective permutation and non-permutation flow shop scheduling problems with no-wait: a systematic literature review. RAIRO-Operations Research, 55(1), 27-50. Doi: https://doi.org/10.1051/ro/2020055
• Spieksma, F. C. ve Woeginger, G. J. (2005). The no-wait flow-shop paradox. Operations Research Letters, 33(6), 603-608. Doi: https://doi.org/10.1016/j.orl.2004.10.007
• Tang, J. ve Song, J. (2010). Discrete particle swarm optimisation combined with no-wait algorithm in stages for scheduling mill roller annealing process, International Journal of Computer Integrated Manufacturing, 23(11), 979-991. Doi: https://doi.org/10.1080/0951192X.2010.506655
• Wang, S. ve Liu, M. (2013). A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem. Computers & Operations Research, 40(4), 1064-1075. Doi: https://doi.org/10.1016/j.cor.2012.10.015
• Wang, S., Liu, M. ve Chu, C. (2015). A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling, International Journal of Production Research, 53(4), 1143-1167. Doi: https://doi.org/10.1080/00207543.2014.949363
• Wang, S., Wang, X. ve Yu, L. (2020). Two-stage no-wait hybrid flowshop scheduling with sequence-dependent setup times, International Journal of Systems Science: Operations & Logistics, 7(3), 291-307. Doi: https://doi.org/10.1080/23302674.2019.1575997
• Xuan, H., Zheng, Q., Li, B. ve Wang, X. (2021). A novel genetic simulated annealing algorithm for no-wait hybrid flowshop problem with unrelated parallel machines. ISIJ International, 61(1), 258-268. Doi: https://doi.org/10.2355/isijinternational.ISIJINT-2020-258
• Zhao, F., Hu, X., Wang, L., Xu, T., Zhu, N. ve Jonrinaldi (2023). A reinforcement learning-driven brain storm optimisation algorithm for multi-objective energy-efficient distributed assembly no-wait flow shop scheduling problem, International Journal of Production Research, 61(9), 2854-2872. Doi: https://doi.org/10.1080/00207543.2022.2070786