SIRA BAĞIMLI HAZIRLIK SÜRELİ MELEZ ESNEK AKIŞ TİPİ ATÖLYELERDE ÇİZELGELEME PROBLEMİ İÇİN SINIRLI SAYIMLAMA VE MAKİNE GRUPLAMAYA DAYALI BİR YAKLAŞIM

Bu çalışmada sıra bağımlı hazırlık zamanlı k kademeli melez akış atölyesi çizelgeleme problemi için bir 0-1 tamsayılı matematiksel model ve sınırlandırılmış sayımlama ve kümeleme tabanlı bir sezgisel algoritma önerilmektedir. Son çalışmalar sıra bağımlı hazırlık zamanlı akış tipi aötlye çizelgeleme problemlerinin klasik atölye çizelgeleme problemlerine göre daha az (2015 itibariyle, 150’den fazla çalışmanın sadece bir kaçı) çalışıldığını göstermektedir. Çalışmada yer verilen matematiksel model beş kademe, sekiz makine, altı işin olduğu bir sistemi kabul edilebilir sürede çözebilmektedir. Akış atölyeleri oluşturma temelinde önerilen sezgisel algoritma ise makalede yer verilen farklı problem büyüklükleri için elde edilen sonuçlardan da görüleceği gibi büyük boyutlu problemleri eniyi ya da eniyi çözüme yakın düzeyde çözebilmektedir. Erişebildiğimiz yayınlara göre, bu tür problemler için akış atölyesi oluşturarak işlerin işlem göreceği makina kombinasyonundaki sayıyı azaltmak ilk defa kullanılan bir yaklaşımdır. Sözkonusu problem için literatürde test verisine rastlanmamaktadır. Bu nedenle gerçek bir üretim atölyesinden elde edilen veri setleri kullanılmıştır. Sonuçlar, önerilen modelin ve geliştirilen sezgisel yaklaşımın işletmede kullanılan mevcut çizelgeleme yaklaşımına oldukça üstün olduğunu göstermektedir. Sezgisel yaklaşım, aynı zamanda kullanıcı dostu bir yaklaşım ile tasarlanarak, tezgahların herhangi bir zamandaki performanslarını, işlerin tamamlanma seviyelerini ve benzeri bazı istatistikleri göstererek karar vericiye destek olabilecek özelliktedir.

Anahtar Kelimeler:

Hybrid Flow Shop, Makespan, Heuristic Approach, Clustering

RESTRICTED ENUMERATION AND MACHINE GROUPING BASED APPROACH FOR HYBRID FLEXIBLE FLOW SHOP SCHEDULING PROBLEMS WITH SEQUENCE-DEPENDENT SETUP TIMES

PDF

___

Allahverdi, A., Ng, C., Cheng, T., & Kovalyov, M. Y. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187 (3), 985–1032. https://doi.org/10.1016/j.ejor.2006.06.060
Allahverdi, A. (2015). The third comprehensive survey on scheduling problems with setup times/costs. European Journal of Operational Research, 246 (2), 345–378. https://doi.org/10.1016/j.ejor.2015.04.004
Andrés, C., Albarracín, J.M., Tormo, G., Vicens, E., García-Sabater, J.P. (2005). Group technology in a hybrid flowshop environment: A case study. European Journal of Operational Research, 167, 272–281. https://doi.org/10.1016/j.ejor.2006.06.060
Dudek, R., Smith, M., Panwalkar, S.(1974). Use of a case study in sequencing-scheduling research. Omega, 2, 253–261. https://doi.org/10.1016/0305-0483(74)90094-2
Gupta, J.N.D. (1988). Two-stage, hybrid flow shop scheduling problem. Journal of the Operational Research Society, 39, 359-364. https://doi.org/10.1057/jors.1988.63
Gholami, Z., Seyed M., Hakimifar, M., Nazemi, N., Jolai, F. (2017). Robust and Fuzzy Optimisation Models for a Flow Shop Scheduling Problem with Sequence Dependent Set Up Times: A real case study on a PCB assembly company. International Journal of Computer Integrated Manufacturing, 30, 552-563. https://doi.org/10.1080/0951192X.2016.1187293
Haouari, M., M'Hallah, R. (1997). Heuristic algorithms for the two-stage hybrid flow shop problem. Operations Research Letters, 21, 43-53. https://doi.org/10.1016/S0167-6377(97)00004-7
Jabbarizadeh, F., Zandieh, M., Talebi, D. (2009). Hybrid flexible flow shops with sequence-dependent setup times and machine availability constraints. Computers & Industrial Engineering, 57, 949–957. https://doi.org/10.1016/j.cie.2009.03.012
Jungwattanakita, J., Chaovalitwongsea, P., Wernerb, P. (2009). A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria. Computers & Operations Research, 36, 358 – 378. https://doi.org/10.1016/j.cor.2007.10.004
Kurz, M.E., Askin, R.G. (2003). Comparing scheduling rules for flexible flow lines. International Journal of Production Economics, 85, 371-388. https://doi.org/10.1016/S0925-5273(03)00123-3
Morais, M.D., Godinho, M., Boiko, T.J.P. (2013). Hybrid flow shop scheduling problems involving setup considerations: a literature review and analysis. International Journal of Industrial Engineering Theory Applications and Practice, 20, 614-630. http://apps.webofknowledge.com/full_record.doproduct=WOS&search_mode=GeneralSearch&qid=1&SID=E33qxsfjVeRX5aVTvvG&page=1&doc=1
Morais, M.F., Boiko T.J.P., Coelho, R.P., Paraiso, P.R. (2014). Multicriteria hybrid flow shop scheduling problem: Literature review, analysis, and future research. Independent Journal of Management & Production, 5, 1004-1031. DOI:10.14807/ijmp.v5i4.242
Naderi, B., Zandieh, M., Shirazi, M.A.H.A. (2009a). Modeling and scheduling a case of flexible flow shops: Total weighted tardiness minimization. Computers & Industrial Engineering, 57, 1258–1267. https://doi.org/10.1016/j.cie.2009.06.005
Naderi, B., Zandieh, M., Balagh, A.K.G., Roshanaei, V. (2009b). An improved simulated annealing for hybrid flow shops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness. Expert Systems with Applications, 36, 9625-9633. DOI: 10.1016/j.eswa.2008.09.063
Naderi, B., Zandieh, M., Roshanaei, V. (2009c). Scheduling hybrid flow shops with sequence dependent setup times to minimize makespan and maximum tardiness. International Journal of Advanced Manufacturing Technology, 41(11–12), 1186-1198. DOI: https://doi.org/10.1007/s00170-008-1569-3
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, 389-400. DOI: 10.1016/S0377-2217(97)00333-0
Pan, Q.K., Gao, L., Li, X., Gao, K. (2017). Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times. Applied Mathematics and Computation, 303, 89-112. https://doi.org/10.1016/j.amc.2017.01.004
Pinedo, M. (2002). Scheduling: Theory Algorithms and Systems, Second Ed., Prentice Hall, Upper Saddle, NJ. ISBN 978-1-4614-2361-4
Ribas, I., Leisten, R., Framinan, J.M. (2010). Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. Computers and Operations Research, 37, 1439-454. doi:10.1016/j.cor.2009.11.001
Ruiz, R., Şerifoğlu, F.S., Urlings, T. (2008). Modeling realistic hybrid flexible flow shop scheduling problems. Computers & Operations Research, 35, 1151-1175. DOI: 10.1016/j.cor.2006.07.014
Ruiz, R., Maroto, C. (2006). A genetic algorithm for hybrid flow shops with sequence dependent setup times and machine eligibility. European Journal of Operational Research, 169, 781-800. https://doi.org/10.1016/j.ejor.2004.06.038
Sioud, A., Gagné, C. (2018). Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times. European Journal of Operational Research, 264, 66-73. https://doi.org/10.1016/j.ejor.2017.06.027
Tian, H., Li, K., Lius, W.(2016). A Pareto-Based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with Sequence-Dependent Setup Time. Mathematical Problems in Engineering, Volume 2016, Article ID 1257060, 11 pages. https://doi.org/10.1155/2016/1257060
Zandieh, M., Ghomi, S.M.T., Husseini, S.M. (2005). General models for hybrid flow shop sequencing problems with sequence dependent setup times. Journal of Faculty of Engineering, 39, 1-9. https://www.sid.ir/En/Journal/ViewPaper.aspx?ID=41251
Zandieh, M., Ghomi, S.M.T., Husseini, S.M. (2006). An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times. Applied Mathematics and Computation, 180, 111–127. https://www.researchgate.net/publication/313073224_An_immune_algorithm_approach_to_hybrid_flow_shops_scheduling_with_sequence-dependent_setup_times
Zhu, X., Wilhelm, W. E. (2006). Scheduling and lot sizing with sequence-dependent setup: A literature review. IIE Transactions, 38, 11, 987–1007. DOI: 10.1080/07408170600559706