BULANIK AKIŞ TİPİ ÇİZELGELEME PROBLEMİ İÇİN ÇOK AMAÇLI GENETİK ALGORİTMA

Öz

Üretim planlama problemlerinin çoğu karar vericinin herhangi bir kararı vermeden önce birden fazla kriteridüşünmesini gerektirirken, çizelgeleme alanında yapılan çalışmaların pek çoğunda sadece bir kriter elealınmıştır. Bu makalede günümüz imalat sistemlerinde büyük öneme sahip m-makineli akış tipi çizelgelemeprobleminde işlem zamanları ve teslim tarihleri gibi zaman parametrelerinin belirsiz olduğu durum ele alınaraküretim tamamlanma zamanı, maksimum gecikme ve toplam akış zamanı amaçlarını eş zamanlı eniyileyengenetik algoritma temelli çok amaçlı bir yaklaşım geliştirilmiştir. Geliştirilen bulanık iş ve teslim zamanlı çokamaçlı genetik algoritma sonucunda amaç değerlerinin üyelik fonksiyonlarıyla ifade edildiği etkin çözümler eldeedilmektedir. Geliştirilen algoritmanın etkinliği küçük boyutlu problemler kullanılarak gösterilmiştir. Genetikalgoritmanın en iyi parametre değerleri faktöriyel deney tasarımı ile belirlenmiştir. Algoritmanın orta ve büyükboyutlardaki problemler için makul zamanda etkin çözümleri ürettiği gösterilmiştir.

Anahtar Kelimeler

• Akış tipi çizelgeleme, bulanık küme, çok amaçlı eniyileme, etkin çözüm, genetik algoritma

Kaynakça

1. Pinedo, M., Scheduling:Theory, algorithms, and
2. systems, Prentice Hall, New Jersey, A.B.D., 2002.
3. Lee, C.E. ve Chou, F.D., “A two-machine
4. flowshop scheduling heuristic with bicriteria
5. objective”, International Journal of Industrial
6. Engineering,Cilt 5, No 2, 128-139, 1998.
7. Nagar, A., Heragu, S. ve Haddock, J., “A
8. combined branch and bound and genetic algorithm

9. based approach for a flowshop scheduling
10. problem”, Annals of Operations Research, Cilt
11. , 397-414, 1996.
12. Şerifoğlu, F.S. ve Ulusoy, G. “A bicriteria twomachine
13. permutation flowshop problem”,
14. European Journal of Operational Research,
15. Cilt 107, No 2, 414-430, 1998.
16. Yeh, W.C., “A new branch-and-bound approach
17. for the n/2/flowshop/αF+βCmax flowshop
18. scheduling problem”, Computers and
19. Operations Research, Cilt 26, No13, 1293-1310,
20. -
21. Neppalli, V.R., Chen, C.L. ve Gupta, J.N.D.,
22. “Genetic algorihms for the two-stage bicriteria
23. flowshop problem”, European Journal of
24. Operational Research, Cilt 95, No 2, 356-373,
25. -
26. Ishibuchi, H. ve Murata, T., “A Multi-objective
27. genetic local search algorithm and its application to flowshop scheduling, IEEE Transaction on
28. System, Man, and Cybernetics-Part C:
29. Applications and Reviews, Cilt 28, No 3, 392-
30. ,1998.
31. Rajendran C., “Two-stage flow shop scheduling
32. problem with bicriteria”, Journal of the
33. Operational Research Society, Cilt 43, No 9,
34. -884, 1992.
35. Gupta, J.N.D., Neppalli, V.R. ve Werner, F.,
36. “Minimizing total flow time in a two-machine
37. flowshop problem with minimum makespan”,
38. International Journal of Production
39. Economics, Cilt 69, No 3, 323-338, 2001.
40. Sayın, S. ve Karabatı, S., “A bicriteria approach to
41. the two-machine flow shop scheduling problem”,
42. European Journal of Operational Research,
43. Cilt 113, No 2, 435-449, 1999.
44. Murata, T., Ishibuchi, H., ve Tanaka, H., “Multiobjective
45. genetic algorithm and its applications to
46. flowshop scheduling”,Computers and Industrial
47. Engineering, Cilt 30, No 4, 957-968, 1996.
48. Daniels, R.L. ve Chambers R.J., “Multiobjective
49. flow-shop scheduling”, Naval research Logistics,
50. Cilt 37, 981-995, 1990.
51. Chakravarthy, K. ve Rajendran, C., “A heuristic
52. for scheduling in a flowshop with the bicriteria of
53. makespan and maximum tardiness minimization”
54. Production Planning and Control, Cilt 10, No 7,
55. -714, 1999.
56. Allahverdi, A., “A new heuristic for m-machine
57. flowshop scheduling problem with bicriteria of
58. makespan and maximum tardiness”, Computers
59. and Operations Research, Cilt 31, No 2, 157-
60. , 2004.
61. Ishii, H., Tada, M. ve Masuda T., “Two
62. scheduling problems with fuzzy due-dates”, Fuzzy
63. Sets and Systems, Cilt 46, 339-347, 1992.
64. Ishibuchi, H., Yamamoto, N., Murata, T. ve
65. Tanaka, H., “Genetic algorithms and
66. neighborhood search algorithms for fuzzy
67. flowshop scheduling problems”, Fuzzy Sets and
68. Systems, Cilt 67, 81-100, 1994.
69. Murata, T., Gen, M. ve Ishibuchi, H., “Multi-
70. Objective Scheduling with Fuzzy Due-Date”,
71. Computers and Industrial Engineering, Cilt 35,
72. No 3-4, 439-442, 1998.
73. McCahon, C. S. ve Lee, E. S., “Job sequencing
74. with fuzzy processing times”, Computers and
75. Mathematics with Applications, Cilt 19, No 7,
76. -41, 1990.
77. McCahon, C. S. ve Lee, E. S., “Fuzzy job
78. sequencing for a flow shop”, European Journal
79. of Operational Research, Cilt 62, No 3, 294-301,
80. -
81. Hong, T. ve Chuang, T.N., “A new triangular
82. fuzzy johnson algorithm”, Computers and
83. Industrial Engineering, Cilt 36, 179-200, 1999.
84. Hong, T.P. ve Chuang, T.N., “Fuzzy Palmer
85. scheduling for flow shops with more than two
86. machines”, Journal of Information Science and
87. Engineering, Cilt 15, 397-406, 1999.
88. Temiz, İ. ve Erol, S., “Fuzzy branch-and-bound
89. algorithm for flow shop scheduling”, Intelligent
90. Manufacturing Systems, Cilt 15, No 4, 449-454,
91. -
92. Balasubramanian, J. ve Grossmann, I.E.,
93. “Scheduling optimization under uncertainty-an
94. alternative approach”, Computers and Chemical
95. Engineering, Cilt 27, 469-490, 2003.
96. Cheng, J., Kise, H. and Matsumoto, H., “A
97. branch-and-bound algorithm with fuzzy inference
98. for a permutation flowshop scheduling problem”,
99. European Journal of Operational Research,
100. Cilt 96, No 3, 578-590, 1997.
101. Akyol, D.E., “Application of neural network to
102. heuristic scheduling algorithms”, Computers and
103. Industrial Engineering, Cilt 46, No 4, 679-696,
104. -
105. Petrovic, S. And Song, X., “A new approach to
106. two-machine flow shop problem with uncertain
107. processing times, Optimization and Engineering,
108. Cilt 7, No 3, 329-342, 2006.
109. Lai, Y.J. ve Hwang, C.L., Fuzzy Mathematical
110. Programming, Springer-Verlag, Berlin, 1992.
111. Lee, E. S. ve Li, R. J., “Comparison of fuzzy
112. numbers based on probability measure of fuzzy
113. events”, Computers and Mathematics with
114. Applications, Cilt 15, No 10, 887-896, 1988.
115. Tsai, Y.C. ve Chuang, T.N., “A new max operator
116. on triangular fuzzy sets”, Journal of The Chinese
117. Fuzzy Systems Association, Cilt 5, No 2, 71-78,
118. -
119. Goldberg, D. E., Genetic Algorithms in Search,
120. Optimization, and Machine Learning, Addison-
121. Wesley, Reading, 1989.
122. Gen, M. and Cheng, R.,Genetic Algorithms and
123. Engineering Design, John Wiley & Sons, New
124. York, 1997.
125. Taillard, E., “Benchmarks for basic scheduling
126. problems”, European Journal of Operational
127. Research, Cilt 64, No 2, 278-285, 1993.
128. Temiz, İ., Bulanık İş ve Teslim Zamanlı Akış
129. Tipi Çizelgeleme Problemi için Çok Amaçlı
130. Genetik Algoritma, Doktora Tezi, Gazi
131. Üniversitesi, Fen Bilimleri Enstitüsü, 2004.