Öz
Bu çalışmada, bir conta fabrikasındaki yeniden dolaşım ve makine uygunluk gibi sürece özgü kısıtların bulunduğu bir esnek atölye tipi çizelgeleme problemi ele alınmıştır. Klasik makine çizelgeleme problemlerinde son işin tamamlanma zamanı, ağırlıklı tamamlanma zamanı, toplam gecikme gibi verimliliği veya maliyeti enküçükleyecek amaçlar ele alınmaktadır. Son yıllarda ise, sürdürülebilir üretim süreçlerinin önem kazanmasıyla bu amaçlara ek olarak, enerji odaklı amaç fonksiyonları gündeme gelmiştir. Bu çalışmada, klasik çoğu çizelgeleme problemlerinden farklı olarak, toplam enerji tüketimini ve toplam ağırlıklı tamamlanma zamanını enküçükleyecek çok amaçlı bir matematiksel model geliştirilmiştir. Bu modelin performansı, GAMS/Cplex çözücüsünde küçük boyutlu test problemleri ve fabrikadaki gerçek hayat problemleri kullanılarak test edilmiştir. Elde edilen sonuçlar tartışılmıştır.
Anahtar Kelimeler
Enerji Etkin Çizelgeleme Esnek Atölye Tipi Makine Çizelgeleme Yeniden Dolaşım Makine Uygunluk Kısıtları Toplam Ağırlıklı Tamamlanma Zamanı
Kaynakça
- Aqel, G. A., Li X. ve Gao L. (2019). A modified iterated greedy algotihm for flexible job shop scheduling problem. Chinese Journal of Mechanical Engineering, 32 (21). doi: https://doi.org/10.1186/s10033-019-0337-7
- Deliktaş, D., Torkul O. ve Üstün Ö. (2019). A flexible job shop cell scheduling with sequence-dependent family setup times and intercellular transportation times using conic scalarization method. International Transactions in Operational Research, 26 (6), 2410-2431. Erişim adresi: https://onlinelibrary.wiley.com/doi/epdf/10.1111/itor.12407
- Demircioğlu, M. (2019). Yapay sinir ağları kullanarak enerji tasarruflu atölye tipi çizelgeleme. Çukurova Üniversitesi Sosyal Bilimler Enstitüsü Dergisi, 28 (3), 143-154. doi: https://doi.org/10.35379/cusosbil.644997
- French, S. (1982). Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop. New York: Ellis Horwood Series.
- Karabulut, M. A. ve Saraç, T. (2019). Kapasite kısıtlı esnek atölye tipi çizelgeleme problemi için üç aşamalı bir çözüm yaklaşımı ve bir işletmede uygulanması. Eskişehir Osmangazi Üniversitesi Mühendislik ve Mimarlık Fakültesi Dergisi, 27 (3), 233-241. doi: http://dx.doi.org/10.31796/ogummf.613268
- Meng, L., Zhang, C., Shao, X. ve Ren, Y. (2019). MILP models for energy-aware flexible job shop scheduling problem. Journal of Cleaner Production, 210, 710-723. doi: https://doi.org/10.1016/j.jclepro.2018.11.021
- Mousakhani, M. (2013). Sequence-dependent setup time flexible job shop scheduling problem to minimise total tardiness. International Journal of Production Research, 51 (12), 3476-3487. doi: https://doi.org/10.1080/00207543.2012.746480
- Salido, M. A., Escamilla, J., Giret A. ve Barber, F. (2016). A genetic algorithm for energy-efficiency in job-shop scheduling. International Journal of Advanced Manufacturing Technology, 85, 1303-1314. Erişim adresi: https://link.springer.com/content/pdf/10.1007/s00170-015-7987-0.pdf
- Saraç, T., Sipahioğlu, A. ve Akyol Özer, E. (2020). A two-stage solution approach for plastic injection machines scheduling problem. Journal of Industrial and Management, 13 (5). doi: http://dx.doi.org/10.3934/jimo.2020022
- Wang, H., Jiang, Z., Wang, Y., Zhang, H. ve Wang, Y. (2018). A two-stage optimization method for energy-saving flexible job-shop scheduling based on energy dynamic characterization. Journal of Cleaner Production, 188, 575-588. doi: https://doi.org/10.1016/j.jclepro.2018.03.254
- Wang, S., Wang, X., Chu, F. ve Yu, J. (2019). An energy-efficient two-stage hybrid flow shop scheduling problem in a glass production. International Journal of Production Research, 58 (8), 2283–2314. doi: https://doi.org/10.1080/00207543.2019.1624857
- Wu, X. ve Sun, Y. (2018). A green scheduling algorithm for flexible job shop with energy-saving measures. Journal of Cleaner Production, 172, 3249-3264. doi: https://doi.org/10.1016/j.jclepro.2017.10.342
- Xing, L. N., Chen, Y. W., Wang, P., Zhao, O. S. ve Xiong, J. (2010). A knowledge-based ant colony optimization for flexible job shop scheduling problems. Applied Soft Computing, 10 (3), 888–896. doi: https://doi.org/10.1016/j.asoc.2009.10.006
- Zhang, G., Gao, L. ve Shi, Y. (2011). An effective genetic algorithm for the flexible job-shop scheduling problem. Expert Systems with Applications, 38 (4), 3563-3573. doi: https://doi.org/10.1016/j.eswa.2010.08.145
Öz
In this study, a flexible job shop scheduling problem with particular constraints such as recirculation and machine suitability in a gasket factory is discussed. In classical machine scheduling problems, the objectives that minimize productivity or cost such as completion time, weighted completion time, total delay are addressed. In recent years, in addition to these objectives, energy-oriented objective functions have become critical with the increasing importance of sustainable production processes. In this study, unlike most classical scheduling problems, a multi-objective mathematical model is developed to minimize total energy consumption and total weighted completion time. The performance of this model has been tested using small-scale test problems and real-life problems from the factory in the GAMS/Cplex solver. The obtained results are discussed
Anahtar Kelimeler
Energy Efficient Scheduling Flexible Job Shop Scheduling Recirculation Machine Eligibility Restrictions Total weighted completion time
Kaynakça
- Aqel, G. A., Li X. ve Gao L. (2019). A modified iterated greedy algotihm for flexible job shop scheduling problem. Chinese Journal of Mechanical Engineering, 32 (21). doi: https://doi.org/10.1186/s10033-019-0337-7
- Deliktaş, D., Torkul O. ve Üstün Ö. (2019). A flexible job shop cell scheduling with sequence-dependent family setup times and intercellular transportation times using conic scalarization method. International Transactions in Operational Research, 26 (6), 2410-2431. Erişim adresi: https://onlinelibrary.wiley.com/doi/epdf/10.1111/itor.12407
- Demircioğlu, M. (2019). Yapay sinir ağları kullanarak enerji tasarruflu atölye tipi çizelgeleme. Çukurova Üniversitesi Sosyal Bilimler Enstitüsü Dergisi, 28 (3), 143-154. doi: https://doi.org/10.35379/cusosbil.644997
- French, S. (1982). Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop. New York: Ellis Horwood Series.
- Karabulut, M. A. ve Saraç, T. (2019). Kapasite kısıtlı esnek atölye tipi çizelgeleme problemi için üç aşamalı bir çözüm yaklaşımı ve bir işletmede uygulanması. Eskişehir Osmangazi Üniversitesi Mühendislik ve Mimarlık Fakültesi Dergisi, 27 (3), 233-241. doi: http://dx.doi.org/10.31796/ogummf.613268
- Meng, L., Zhang, C., Shao, X. ve Ren, Y. (2019). MILP models for energy-aware flexible job shop scheduling problem. Journal of Cleaner Production, 210, 710-723. doi: https://doi.org/10.1016/j.jclepro.2018.11.021
- Mousakhani, M. (2013). Sequence-dependent setup time flexible job shop scheduling problem to minimise total tardiness. International Journal of Production Research, 51 (12), 3476-3487. doi: https://doi.org/10.1080/00207543.2012.746480
- Salido, M. A., Escamilla, J., Giret A. ve Barber, F. (2016). A genetic algorithm for energy-efficiency in job-shop scheduling. International Journal of Advanced Manufacturing Technology, 85, 1303-1314. Erişim adresi: https://link.springer.com/content/pdf/10.1007/s00170-015-7987-0.pdf
- Saraç, T., Sipahioğlu, A. ve Akyol Özer, E. (2020). A two-stage solution approach for plastic injection machines scheduling problem. Journal of Industrial and Management, 13 (5). doi: http://dx.doi.org/10.3934/jimo.2020022
- Wang, H., Jiang, Z., Wang, Y., Zhang, H. ve Wang, Y. (2018). A two-stage optimization method for energy-saving flexible job-shop scheduling based on energy dynamic characterization. Journal of Cleaner Production, 188, 575-588. doi: https://doi.org/10.1016/j.jclepro.2018.03.254
- Wang, S., Wang, X., Chu, F. ve Yu, J. (2019). An energy-efficient two-stage hybrid flow shop scheduling problem in a glass production. International Journal of Production Research, 58 (8), 2283–2314. doi: https://doi.org/10.1080/00207543.2019.1624857
- Wu, X. ve Sun, Y. (2018). A green scheduling algorithm for flexible job shop with energy-saving measures. Journal of Cleaner Production, 172, 3249-3264. doi: https://doi.org/10.1016/j.jclepro.2017.10.342
- Xing, L. N., Chen, Y. W., Wang, P., Zhao, O. S. ve Xiong, J. (2010). A knowledge-based ant colony optimization for flexible job shop scheduling problems. Applied Soft Computing, 10 (3), 888–896. doi: https://doi.org/10.1016/j.asoc.2009.10.006
- Zhang, G., Gao, L. ve Shi, Y. (2011). An effective genetic algorithm for the flexible job-shop scheduling problem. Expert Systems with Applications, 38 (4), 3563-3573. doi: https://doi.org/10.1016/j.eswa.2010.08.145
Ayrıntılar
| Birincil Dil | Türkçe |
|---|---|
| Konular | Endüstri Mühendisliği |
| Bölüm | Araştırma Makaleleri |
| Yazarlar | |
| Yayımlanma Tarihi | 30 Nisan 2021 |
| Kabul Tarihi | 10 Mart 2021 |
| Yayımlandığı Sayı | Yıl 2021 Cilt: 29 Sayı: 1 |
