THE DYNAMIC FACILITY LAYOUT PROBLEMS WITH CLOSENESS RATE: A FUZZY DECISION SUPPORT SYSTEM APPROACH
Öz
One of the most important characteristics of modern manufacturing is the continuous variability of the demand. Today’s business world should be able to respond to sudden changes in order to survive the competitive environment. The dynamic layout planning that take into account the variability of demand in certain time periods is an example of these studies. The dynamic facility layout problems (DFLP) attempt to balance the handling and transportation costs. In this study, closeness rates between the departments are used as a parameter in DFLP model. In addition, a fuzzy decision system which integrates multiple input types is proposed to determine the closeness rates and an DFLP instance consisting of six departments and five periods is solved. Results obtained for conventional closeness rates and the rates obtained by the offered method are reported. The results indicate the superiority of the offered model over the conventional one.
Anahtar Kelimeler
Kaynakça
- Altaş, İ.H., 1999, ‚Bulanık Mantık: Bulanık denetim‛, Enerji, Elektrik, Elektromekanik-3e, Vol. 64, pp. 76-81.
- Balakrishnan, J., Jacobs, F.R.,Venkataramanan, M.A., 1992, ‚Solutions for The Constrained Dynamic Facility Layout Problem‛, European Journal of Operational Research, Vol. 15, pp. 280-286.
- Balakrishnan, J., Cheng, C.H., 1998, ‚Dynamic Layout Algorithms: A State-of-The-Art Survey‛, Omega, Vol. 26(4), pp. 507-521.
- Balakrishnan, J., Cheng, C.H., 2000, ‚Genetic Search and The Dynamic Layout Problem‛, Computers and Operations Research, Vol. 27(6), pp. 587-593.
- Balakrishnan, J., Cheng, C.H., Conway, D.G., Lau, C.M., 2003, ‚A Hybrid Genetic Algorithm For The Dynamic Plant Layout Problem‛, International Journal of Production Economics, Vol. 86, pp. 107–120.
- Baykasoğlu, A., Gindy, N.N.Z., 2001, ‚A Simulated Annealing Algorithm for Dynamic Layout Problem”, Computers and Operations Research, Vol. 28, pp. 1403-1426.
- Baykasoglu, A., Dereli, T., Sabuncu, I., 2006, ‚An Ant Colony Algorithm for Solving Budget Constrained and Unconstrained Dynamic Facility Layout Problems‛, Omega-International Journal of Management Science, Vol. 34(4), pp. 385–396.
- Benlic, U., Hao, J-K., 2013, ‚Break Local Search for The Quadratic Assignment Problem‛, Applied Mathematics and Computation, Vol. 219(9), pp. 4800-4815.
Ayrıntılar
Birincil Dil
İngilizce
Konular
Mühendislik
Bölüm
Araştırma Makalesi
Yayımlanma Tarihi
1 Eylül 2017
Gönderilme Tarihi
8 Şubat 2017
Kabul Tarihi
30 Mart 2017
Yayımlandığı Sayı
Yıl 2017 Cilt: 5 Sayı: 3