Research Article
BibTex RIS Cite

BİR İPLİK FABRİKASINDA SİPARİŞLERİN ÇİZELGELENMESİ

Year 2021, , 64 - 76, 30.04.2021

Çiğdem Şenbay Tuğba Saraç , Ezgi Aktar Demirtaş

https://doi.org/10.31796/ogummf.750443
Cited By: 1

Abstract

Bu çalışmada, iplik üretimi yapan bir tekstil firmasında yaşanan çizelgeleme problemi ele alınmıştır. Tekstil firması, hızlı moda sektöründeki müşterilere hizmet verdiği için, servis göstergelerinde hız ön plana çıkmaktadır. Hızlı moda sektöründe, tasarımdan satışa sunum, üç hafta gibi kısa sürelere düştüğü için, tüm siparişlerin kısa bir süre içinde tamamlanabilmesi kritik bir hal almakta ve her geciken sipariş müşteri firmaların üretim hatlarında duruşlara veya müşteri kayıplarına yol açabilmektedir. Ele alınan problem literatürde paralel makine çizelgeleme problemi olarak adlandırılmaktadır. Paralel makine çizelgeleme, n sayıda işin aynı işlemleri yapabilen m sayıda makineye atanmasıdır. Bu çalışmada özdeş makinalara atanacak işlerin hazırlık süreleri iş sırasına bağlıdır. Amaçlar, teslim süresinden geç tamamlanan işlerin sayısının ve en büyük tamamlanma zamanının enküçüklenmesidir. Ele alınan problem için bir matematiksel model geliştirilmiştir. Problemin Np-zor doğası gereği matematiksel modelle büyük boyutlu problemlerin çözümü mümkün olamayacağından, gerçek hayat problemlerinin çözümü için bir tavlama benzetimi algoritması önerilmiştir. Önerilen yöntemle elde edilen çizelgeler, firmada kullanılmakta olan çizelgelerle karşılaştırılmış ve elde edilen sonuçlar yorumlanmıştır.

Keywords

Paralel makine çizelgeleme Sıra bağımlı hazırlık süresi Çok amaçlı çizelgeleme Tavlama benzetimi Hızlı moda sektörü

References

  • Afzalirad, M. ve Rezaeian, J. (2016) Resource-constrained unrelated parallel machine scheduling problem with sequence dependent setup times, precedence constraints and machine eligibility restrictions. Computers and Industrial Engineering, 98, 40-52. doi: https://doi.org /10.1016/ j.cie.2016.05.020
  • Akyol, E. (2013) Hazırlık süreli, makine uygunluk kısıtları ve ortak kaynak olduğu sıra bağımlı paralel makine çizelgeleme problemi için model etkileşimli genetik algoritma, Yüksek lisans tezi, Fen Bilimleri Enstitüsü, Eskişehir Osmangazi Üniversitesi.
  • Anghinolfi, D. ve Paolucci, M. (2007) Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach. Computers & Operations Research, 34, 3471-3490. doi: https:// doi.org/10.1016/j.cor.2006.02.009
  • Chen, C.L. ve Chen, C.L. (2008) Hybrid metaheuristics for unrelated parallel machine scheduling with sequence-dependent setup times. International Journal of Advanced Manufacturing Technologies, 43, 161-169. doi: https://doi.org/10.1007/s00170-008-1692-1
  • Chen, J.F. (2009) Scheduling on unrelated parallel machines with sequence-and machine dependent setup times and due-date constraints. The International Journal of Advanced Manufacturing Technology, 44, 1204-1212. doi: https:// doi.org/10.1007/s00170-008-1917-3
  • Chen, Z.L. ve Powell, W.B. (2003) Exact algorithms for scheduling multiple families of jobs on parallel machines. Naval Research Logistics, 50, 823-840. doi: https://doi.org/10.1002/nav.10091
  • Cura, T. (2008) Modern sezgisel teknikler ve uygulamaları, Papatya Yayıncılık, İstanbul.
  • Gascon, A. ve Leachman R.C. (1998) A dynamic programming solution to the dynamic, multi- item, single machine scheduling problem. Operations Research, 36, 1, 50-56. doi: https://doi.org/10.1287/opre.36.1.50
  • Gen, M. (1996) Genetic algorithms and industrial engineering. Computer and Industrial Engineering, 30, 4, 835-837.
  • Gupta, J.N.D. ve Torres, A.J.R. (2004) Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs. European Journal of Operational Research, 167, 679-695. doi: https://doi.org/10.1016/j.ejor.2004.07.015
  • Heady, R.B. ve Zhu, Z. (1998) Minimizing the sum of job earliness and tardiness in a multimachine system. International Journal of Production Research, 36, 1619-1632. doi: https://doi.org/ 10.1080/ 002075498193192
  • Ho, J.C. ve Chang, Y.L. (1993) Minimizing the number of tardy jobs for m parallel machines. European Journal of Operational Research, 84, 343-355.
  • Kang, Y.H. ve Shin, H.J. (2010) An adaptive scheduling algorithm for a parallel machine problem with rework process. International Journal of Production Research, 48, 1, 95-115. doi: https: //doi.org/ 10.1080/00207540802484903
  • Lee, K., Lei, L. ve Pinedo, M. (2011) Production scheduling with history-dependent setup times. Naval Research Logistics, 59, 58-68. doi: https://doi.org/10.1002/nav.21472
  • Lee, Y.H. ve Pinedo, M. (1997) Scheduling jobs on parallel machines with sequence dependent setup times. European Journal of Operational Research, 100, 464-474. doi: https://doi.org/ 10.1007/ s001700200105
  • Lin, B.M.T ve Jeng, A.A.K. (2003) Parallel-machine batch scheduling to minimize the maximum lateness and the number of tardy jobs. International Journal of Production Economics, 91, 121-134. doi: https:// doi.org/10.1016/j.ijpe.2003.07.003
  • Lin, S.W., Lee, Z.J., Ying, K.C. ve Lu, C.C. (2010) Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates. Computers and Operations Research, 38, 809-815. doi: https:// doi.org/ 10.1016/j.cor.2010.09.020
  • Lin, Y.K., Fowler, J.W. ve Pfund, M.E. (2013) Multi-objective heuristics for schedulingunrelated parallel machines. European Journal of Operational Research, 227, 2, 239-253. doi: https://doi.org /10.1016/ j.ejor.2012.10.008
  • Logendran, R., McDonell, B. ve Smucker, B. (2006) Scheduling unrelated parallel machines with sequence-dependent setups. Applied Mathematics and Computation, 181, 2, 1008–1017. doi: https:// doi.org/10.1016/j.cor.2006.02.006
  • Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H. ve Teller, E. (1958) Equations of state calculations by fast computing machines. The Journal of Chemical Physics., 21, 1087-1092. doi: http://dx.doi.org/10.1063/1.1699114
  • M’Hallah R. ve Bulfin, R.L. (2003) Minimizing the weighted number of tardy jobs on parallel processors. European Journal of Operational Research, 160, 471-484. doi: https://doi.org/ 10.3934/ jimo.2016.12.1465
  • M’Hallah R. ve Al-Khamis, T. (2015) A Benders decomposition approach to the weighted number of tardy jobs scheduling problem on unrelated parallel machines with production costs. International Journal of Production Research, 53, 19, 5977-5987. doi:https://doi.org/10.1080/00207543.2015.1033501
  • Moghaddam, R.T., Taheri F., Bazzazi, M., Izadi M. ve Sassani, F. (2009) Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints. Computers and Operations Research, 36, 3224-3230. doi: https:// doi.org/10.1016/j.cor.2009.02.012
  • Nazif, H. ve Lee, L.S. (2009) A genetic algorithm on single machine scheduling problem to minimise total weighted completion time. European Journal of Scientific Research, 35, 444-452.
  • Nelson, R.T., Sarin, R.K. ve Daniels, R.L. (1986) Scheduling with multiple performance measures: The one machine case. Management Science, 32, 4, 464-479. doi: https://www.jstor.org/stable/ 2631580
  • Özsüt, Z. (2015) Konteynır yükleme problemleri için matematiksel modeller ve çözüm yöntemleri, Yüksek Lisans tezi, Anadolu Üniversitesi Fen Bilimleri Enstitüsü.
  • Pinedo, M. (2002), Scheduling theory, algorithms and systems, Prentice Hall, 2nd Edition, New Jersey.
  • Reeves, C.R. (1995) Modern heuristic techniques for combinatorial problems, Mc Graw-Hill, UK.
  • Sankar, S., Ponnambalam, S.G., Rathinavel, V. ve Viveshvaren, M.S. (2005) Scheduling in parallel machine shop: an antcolony optimization approach, Institute of Electrical and Electronics Engineers (IEEE), 276-280. doi: https://doi.org/ 10.1109/ ICIT.2005.1600649
  • Shim, S. ve Kim, Y. (2007) Scheduling on parallel identical machines to minimize total tardiness. European Journal of Operation Research, 177, 135-146. doi: https://doi.org /10.1016/ j.ejor.2005.09.038
  • Silva, C.A., Sousa, J.M., Runkler, T.A., Palm, R., ve Sa da Costa, J.M. (2002) Scheduling in manufacturing systems using the ant colonies optimization algorithm. Proceedings of 5st Portuguese conference on automatic control, Portuguese. doi: https://doi.org/10.5772/51487
  • Torres, A.J.R, Enscore, E.E. ve Barton, R.R. (1997) Simulated annealing heuristics for the average flow-time and the number of tardy jobs bi-criteria identical parallel machine problem. Computers and Industrial Engineering, 33, 1-2, 257-260. doi: https://doi.org/10.1016/S0360-8352(97)00087-9
  • Yalaoui F. ve Chu C. (2002), Parallel machine scheduling to minimize total tardiness. International Journal of Production Economics, 76, 265-279. doi: https://doi.org/10.1016/S0925-5273(01)00175-X
  • Williams D. ve Wirth A. (1996) A new heuristic for a single machine scheduling problem with set-up times. Journal of Operational Research Society, 47, 175-180. doi: https://doi.org /10.2307/2584261

Year 2021, , 64 - 76, 30.04.2021

Çiğdem Şenbay Tuğba Saraç , Ezgi Aktar Demirtaş

https://doi.org/10.31796/ogummf.750443
Cited By: 1

Abstract

References

  • Afzalirad, M. ve Rezaeian, J. (2016) Resource-constrained unrelated parallel machine scheduling problem with sequence dependent setup times, precedence constraints and machine eligibility restrictions. Computers and Industrial Engineering, 98, 40-52. doi: https://doi.org /10.1016/ j.cie.2016.05.020
  • Akyol, E. (2013) Hazırlık süreli, makine uygunluk kısıtları ve ortak kaynak olduğu sıra bağımlı paralel makine çizelgeleme problemi için model etkileşimli genetik algoritma, Yüksek lisans tezi, Fen Bilimleri Enstitüsü, Eskişehir Osmangazi Üniversitesi.
  • Anghinolfi, D. ve Paolucci, M. (2007) Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach. Computers & Operations Research, 34, 3471-3490. doi: https:// doi.org/10.1016/j.cor.2006.02.009
  • Chen, C.L. ve Chen, C.L. (2008) Hybrid metaheuristics for unrelated parallel machine scheduling with sequence-dependent setup times. International Journal of Advanced Manufacturing Technologies, 43, 161-169. doi: https://doi.org/10.1007/s00170-008-1692-1
  • Chen, J.F. (2009) Scheduling on unrelated parallel machines with sequence-and machine dependent setup times and due-date constraints. The International Journal of Advanced Manufacturing Technology, 44, 1204-1212. doi: https:// doi.org/10.1007/s00170-008-1917-3
  • Chen, Z.L. ve Powell, W.B. (2003) Exact algorithms for scheduling multiple families of jobs on parallel machines. Naval Research Logistics, 50, 823-840. doi: https://doi.org/10.1002/nav.10091
  • Cura, T. (2008) Modern sezgisel teknikler ve uygulamaları, Papatya Yayıncılık, İstanbul.
  • Gascon, A. ve Leachman R.C. (1998) A dynamic programming solution to the dynamic, multi- item, single machine scheduling problem. Operations Research, 36, 1, 50-56. doi: https://doi.org/10.1287/opre.36.1.50
  • Gen, M. (1996) Genetic algorithms and industrial engineering. Computer and Industrial Engineering, 30, 4, 835-837.
  • Gupta, J.N.D. ve Torres, A.J.R. (2004) Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs. European Journal of Operational Research, 167, 679-695. doi: https://doi.org/10.1016/j.ejor.2004.07.015
  • Heady, R.B. ve Zhu, Z. (1998) Minimizing the sum of job earliness and tardiness in a multimachine system. International Journal of Production Research, 36, 1619-1632. doi: https://doi.org/ 10.1080/ 002075498193192
  • Ho, J.C. ve Chang, Y.L. (1993) Minimizing the number of tardy jobs for m parallel machines. European Journal of Operational Research, 84, 343-355.
  • Kang, Y.H. ve Shin, H.J. (2010) An adaptive scheduling algorithm for a parallel machine problem with rework process. International Journal of Production Research, 48, 1, 95-115. doi: https: //doi.org/ 10.1080/00207540802484903
  • Lee, K., Lei, L. ve Pinedo, M. (2011) Production scheduling with history-dependent setup times. Naval Research Logistics, 59, 58-68. doi: https://doi.org/10.1002/nav.21472
  • Lee, Y.H. ve Pinedo, M. (1997) Scheduling jobs on parallel machines with sequence dependent setup times. European Journal of Operational Research, 100, 464-474. doi: https://doi.org/ 10.1007/ s001700200105
  • Lin, B.M.T ve Jeng, A.A.K. (2003) Parallel-machine batch scheduling to minimize the maximum lateness and the number of tardy jobs. International Journal of Production Economics, 91, 121-134. doi: https:// doi.org/10.1016/j.ijpe.2003.07.003
  • Lin, S.W., Lee, Z.J., Ying, K.C. ve Lu, C.C. (2010) Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates. Computers and Operations Research, 38, 809-815. doi: https:// doi.org/ 10.1016/j.cor.2010.09.020
  • Lin, Y.K., Fowler, J.W. ve Pfund, M.E. (2013) Multi-objective heuristics for schedulingunrelated parallel machines. European Journal of Operational Research, 227, 2, 239-253. doi: https://doi.org /10.1016/ j.ejor.2012.10.008
  • Logendran, R., McDonell, B. ve Smucker, B. (2006) Scheduling unrelated parallel machines with sequence-dependent setups. Applied Mathematics and Computation, 181, 2, 1008–1017. doi: https:// doi.org/10.1016/j.cor.2006.02.006
  • Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H. ve Teller, E. (1958) Equations of state calculations by fast computing machines. The Journal of Chemical Physics., 21, 1087-1092. doi: http://dx.doi.org/10.1063/1.1699114
  • M’Hallah R. ve Bulfin, R.L. (2003) Minimizing the weighted number of tardy jobs on parallel processors. European Journal of Operational Research, 160, 471-484. doi: https://doi.org/ 10.3934/ jimo.2016.12.1465
  • M’Hallah R. ve Al-Khamis, T. (2015) A Benders decomposition approach to the weighted number of tardy jobs scheduling problem on unrelated parallel machines with production costs. International Journal of Production Research, 53, 19, 5977-5987. doi:https://doi.org/10.1080/00207543.2015.1033501
  • Moghaddam, R.T., Taheri F., Bazzazi, M., Izadi M. ve Sassani, F. (2009) Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints. Computers and Operations Research, 36, 3224-3230. doi: https:// doi.org/10.1016/j.cor.2009.02.012
  • Nazif, H. ve Lee, L.S. (2009) A genetic algorithm on single machine scheduling problem to minimise total weighted completion time. European Journal of Scientific Research, 35, 444-452.
  • Nelson, R.T., Sarin, R.K. ve Daniels, R.L. (1986) Scheduling with multiple performance measures: The one machine case. Management Science, 32, 4, 464-479. doi: https://www.jstor.org/stable/ 2631580
  • Özsüt, Z. (2015) Konteynır yükleme problemleri için matematiksel modeller ve çözüm yöntemleri, Yüksek Lisans tezi, Anadolu Üniversitesi Fen Bilimleri Enstitüsü.
  • Pinedo, M. (2002), Scheduling theory, algorithms and systems, Prentice Hall, 2nd Edition, New Jersey.
  • Reeves, C.R. (1995) Modern heuristic techniques for combinatorial problems, Mc Graw-Hill, UK.
  • Sankar, S., Ponnambalam, S.G., Rathinavel, V. ve Viveshvaren, M.S. (2005) Scheduling in parallel machine shop: an antcolony optimization approach, Institute of Electrical and Electronics Engineers (IEEE), 276-280. doi: https://doi.org/ 10.1109/ ICIT.2005.1600649
  • Shim, S. ve Kim, Y. (2007) Scheduling on parallel identical machines to minimize total tardiness. European Journal of Operation Research, 177, 135-146. doi: https://doi.org /10.1016/ j.ejor.2005.09.038
  • Silva, C.A., Sousa, J.M., Runkler, T.A., Palm, R., ve Sa da Costa, J.M. (2002) Scheduling in manufacturing systems using the ant colonies optimization algorithm. Proceedings of 5st Portuguese conference on automatic control, Portuguese. doi: https://doi.org/10.5772/51487
  • Torres, A.J.R, Enscore, E.E. ve Barton, R.R. (1997) Simulated annealing heuristics for the average flow-time and the number of tardy jobs bi-criteria identical parallel machine problem. Computers and Industrial Engineering, 33, 1-2, 257-260. doi: https://doi.org/10.1016/S0360-8352(97)00087-9
  • Yalaoui F. ve Chu C. (2002), Parallel machine scheduling to minimize total tardiness. International Journal of Production Economics, 76, 265-279. doi: https://doi.org/10.1016/S0925-5273(01)00175-X
  • Williams D. ve Wirth A. (1996) A new heuristic for a single machine scheduling problem with set-up times. Journal of Operational Research Society, 47, 175-180. doi: https://doi.org /10.2307/2584261
There are 34 citations in total.

Details

Primary Language Turkish
Subjects Industrial Engineering
Journal Section Research Articles
Authors

Çiğdem Şenbay This is me 0000-0002-3414-6978

Tuğba Saraç 0000-0002-8115-3206

Ezgi Aktar Demirtaş 0000-0002-3762-6256

Publication Date April 30, 2021
Acceptance Date February 19, 2021
Published in Issue Year 2021

Cite

APA Şenbay, Ç., Saraç, T., & Aktar Demirtaş, E. (2021). BİR İPLİK FABRİKASINDA SİPARİŞLERİN ÇİZELGELENMESİ. Eskişehir Osmangazi Üniversitesi Mühendislik Ve Mimarlık Fakültesi Dergisi, 29(1), 64-76. https://doi.org/10.31796/ogummf.750443
AMA Şenbay Ç, Saraç T, Aktar Demirtaş E. BİR İPLİK FABRİKASINDA SİPARİŞLERİN ÇİZELGELENMESİ. ESOGÜ Müh Mim Fak Derg. April 2021;29(1):64-76. doi:10.31796/ogummf.750443
Chicago Şenbay, Çiğdem, Tuğba Saraç, and Ezgi Aktar Demirtaş. “BİR İPLİK FABRİKASINDA SİPARİŞLERİN ÇİZELGELENMESİ”. Eskişehir Osmangazi Üniversitesi Mühendislik Ve Mimarlık Fakültesi Dergisi 29, no. 1 (April 2021): 64-76. https://doi.org/10.31796/ogummf.750443.
EndNote Şenbay Ç, Saraç T, Aktar Demirtaş E (April 1, 2021) BİR İPLİK FABRİKASINDA SİPARİŞLERİN ÇİZELGELENMESİ. Eskişehir Osmangazi Üniversitesi Mühendislik ve Mimarlık Fakültesi Dergisi 29 1 64–76.
IEEE Ç. Şenbay, T. Saraç, and E. Aktar Demirtaş, “BİR İPLİK FABRİKASINDA SİPARİŞLERİN ÇİZELGELENMESİ”, ESOGÜ Müh Mim Fak Derg, vol. 29, no. 1, pp. 64–76, 2021, doi: 10.31796/ogummf.750443.
ISNAD Şenbay, Çiğdem et al. “BİR İPLİK FABRİKASINDA SİPARİŞLERİN ÇİZELGELENMESİ”. Eskişehir Osmangazi Üniversitesi Mühendislik ve Mimarlık Fakültesi Dergisi 29/1 (April 2021), 64-76. https://doi.org/10.31796/ogummf.750443.
JAMA Şenbay Ç, Saraç T, Aktar Demirtaş E. BİR İPLİK FABRİKASINDA SİPARİŞLERİN ÇİZELGELENMESİ. ESOGÜ Müh Mim Fak Derg. 2021;29:64–76.
MLA Şenbay, Çiğdem et al. “BİR İPLİK FABRİKASINDA SİPARİŞLERİN ÇİZELGELENMESİ”. Eskişehir Osmangazi Üniversitesi Mühendislik Ve Mimarlık Fakültesi Dergisi, vol. 29, no. 1, 2021, pp. 64-76, doi:10.31796/ogummf.750443.
Vancouver Şenbay Ç, Saraç T, Aktar Demirtaş E. BİR İPLİK FABRİKASINDA SİPARİŞLERİN ÇİZELGELENMESİ. ESOGÜ Müh Mim Fak Derg. 2021;29(1):64-76.

Cited By

TEKSTİL SEKTÖRÜNDE RİNG MAKİNESİ SİPARİŞ ÇİZELGELEME PROBLEMİ: HAZILIK SÜRELERİNİN MİNİMİZASYONU
Tekstil ve Mühendis
https://doi.org/10.7216/teksmuh.1478559

20873 13565 13566 15461 13568  14913