THE THEORY OF DISCRETE OPTIMIZATION AND ITS RELATIONSHIP WITH FACILITIES LAYOUT
Öz
Discrete Optimization is a branch of Combinatorical Mathematics. Certainly that
Discrete Optimization does not encompass all of the Combination Theory which has
been a very vast field. If plant layout topic is studied, it consists of base on
combinatorics. This stance bases on analysis and selecting of the elements which
have been feasible solution state among mutually exclusive alternatives. In our
study, using the Discrete Optimizing Theory, an algorithm is developed to obtain a
near-optimal plant layout for the Net Present Value of material handling cost (the
transportation east), and the Net Present Value of penalty cost for breaking up
departments into sections, and the Net Present Value of calculation cost of computer
(the east of CPU time) the man-machine-material variables in any plant.
Furthermore, The Discrete Optimizing Theory is summarized.
Anahtar Kelimeler
Ayrıntılar
Birincil Dil
İngilizce
Konular
Mimarlık
Bölüm
Araştırma Makalesi
Yazarlar
Orhan Türkbey
Bu kişi benim
Yayımlanma Tarihi
1 Mart 2013
Gönderilme Tarihi
26 Haziran 2014
Kabul Tarihi
-
Yayımlandığı Sayı
Yıl 1996 Cilt: 11 Sayı: 1