Now showing items 1-9 of 9

    • 2. KOBİ’ler ve Verimlilik Kongresi 

      Gençyılmaz, Güneş; Eliaçık, Mehtap (İstanbul Kültür Üniversitesi / İktisadi ve İdari Bilimler Fakültesi / İşletme Bölümü / KOBİ Danışma Birimi, 2005-12)
    • 3. KOBİ’ler ve Verimlilik Kongresi 

      Gençyılmaz, Güneş; Savcı Gökgöz, Gülsüm; Arıker, Çağla (İstanbul Kültür Üniversitesi / İktisadi ve İdari Bilimler Fakültesi / İşletme Bölümü / KOBİ Danışma Birimi, 2006-11)
    • 4. KOBİ’ler ve Verimlilik Kongresi 

      Gençyılmaz, Güneş; Savcı Gökgöz, Gülsüm; Arıker, Çağla (İstanbul Kültür Üniversitesi / İktisadi ve İdari Bilimler Fakültesi / İşletme Bölümü / KOBİ Danışma Birimi, 2007-12)
    • 5. KOBİ’ler ve Verimlilik Kongresi 

      Gençyılmaz, Güneş; Savcı Gökgöz, Gülsüm; Sönmez, Asuman; Ataseven, Burçin (İstanbul Kültür Üniversitesi / İktisadi ve İdari Bilimler Fakültesi / İşletme Bölümü / KOBİ Danışma Birimi, 2008-11)
    • 6. KOBİ’ler ve Verimlilik Kongresi 

      Gençyılmaz, Güneş; Savcı Gökgöz, Gülsüm; Sönmez, Asuman; Ataseven, Burçin (İstanbul Kültür Üniversitesi / İktisadi ve İdari Bilimler Fakültesi / İşletme Bölümü / KOBİ Danışma Birimi, 2009-11)
    • A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem 

      Taşgetiren, M. Fatih; Liang, Yun-Chia; Şevkli, Mehmet; Gençyılmaz, Güneş (ELSEVIER SCIENCE BV, PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS, 2007-03-16)
      In this paper, a particle swarm optimization algorithm (PSO) is presented to solve the permutation flowshop sequencing problem (PFSP) with the objectives of minimizing makespan and the total flowtime of jobs. For this ...
    • Particle swarm optimization algorithm for permutation flowshop sequencing problem 

      Taşgetiren, M. Fatih; Şevkli, Mehmet; Liang, Y. C.; Gençyılmaz, Güneş (SPRINGER-VERLAG BERLIN, HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY, 2004)
      This paper presents a particle swarm optimization algorithm (PSO) to solve the permutation flowshop sequencing problem (PFSP) with makespan criterion. Simple but very efficient local search based on the variable neighborhood ...
    • Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem 

      Taşgetiren, M. Fatih; Liang, Yun-Chia; Şevkli, Mehmet; Gençyılmaz, Güneş (TAYLOR & FRANCIS LTD, 4 PARK SQUARE, MILTON PARK, ABINGDON OX14 4RN, OXON, ENGLAND, 2006-11-15)
      In this paper we present two recent metaheuristics, particle swarm optimization and differential evolution algorithms, to solve the single machine total weighted tardiness problem, which is a typical discrete combinatorial ...
    • The Modified Fuzzy Art and a Two-Stage Clustering Approach to Cell Design 

      Özdemir, Rifat Gürcan; Gençyılmaz, Güneş; Aktin, Ayşe Tülin (ELSEVIER SCIENCE INC, 360 PARK AVE SOUTH, NEW YORK, NY 10010-1710 USA, 2007-12-01)
      This study presents a new pattern recognition neural network for clustering problems, and illustrates its use for machine cell design in group technology. The proposed algorithm involves modifications of the learning ...