Now showing items 1-20 of 36

    • Analytical loading models in flexible manufacturing systems 

      Kırkavak, N.; Dinçer, C. (Elsevier, 1993)
      It would be difficult to efficiently implement a manufacturing system without solving its design and operational problems. Based on this framework, a system configuration and tooling problem is modeled. The model turns out ...
    • Application mapping algorithms for mesh-based network-on-chip architectures 

      Tosun, S.; Ozturk, O.; Ozkan, E.; Ozen, M. (Springer New York LLC, 2015-03)
      Due to shrinking technology sizes, more and more processing elements and memory blocks are being integrated on a single die. However, traditional communication infrastructures (e.g., bus or point-to-point) cannot handle ...
    • Arguing to defeat: eristic argumentation and irrationality in resolving moral concerns 

      Kurdoğlu, Rasim Serdar; Ateş, N. Y. (Springer, 2020)
      By synthesizing the argumentation theory of new rhetoric with research on heuristics and motivated reasoning, we develop a conceptual view of argumentation based on reasoning motivations that sheds new light on the morality ...
    • Bicriteria multiresource generalized assignment problem 

      Karsu, O.; Azizoglu, M. (John Wiley & Sons, 2014)
      In this study,we consider a bicriteria multiresource generalized assignment problem. Our criteria are the total assignment load and maximum assignment load over all agents. We aim to generate all nondominated objective ...
    • CCİ Ankara için talep toplama sistemi tasarımı 

      Anasoy, Şeyma; Kara, Semiha; Koçer, Oğuz; Taşkın, Gülce Simge; Yılmaz, Eren; Kara, Bahar Yetiş; Taysı, Tansel; Kökten, Simge (TMMOB Makina Mühendisleri Odası, 2010)
      CCİ Satış ile müşteriler arasında bir arayüz oluşturan ön satış elemanları sabah ve akşam ofise gelmektedir. Harcanan bu zaman müşteri ilişkilerinin azalmasına, dolayısıyla CCİ’nin satış sistemindeki verimliliğinin azalmasına ...
    • Climbing depth-bounded discrepancy search for solving hybrid flow shop problems 

      Hmida, A. B.; Huguet, M.-J.; Lopez, P.; Haouari, M. (Inderscience Publishers, 2007)
      This paper investigates how to adapt some discrepancy-based search methods to solve Hybrid Flow Shop (HFS) problems in which each stage consists of several identical machines operating in parallel. The objective is ...
    • A comparative study of computational procedures for the resource constrained project scheduling problem 

      Oğuz, O.; Bala, H. (Elsevier, 1994)
      Performance of two new integer programming based heuristics together with some special purpose algorithms for project scheduling are tested from a computational point of view. The objective of the study is to compare the ...
    • A comparison of fixed and dynamic pricing policies in revenue management 

      Şen, A. (2013)
      We consider the problem of selling a fixed capacity or inventory of items over a finite selling period. Earlier research has shown that using a properly set fixed price during the selling period is asymptotically optimal ...
    • Computational aspects of the maximum diversity problem 

      Ghosh, J. B. (Elsevier, 1996)
      We address two variations of the maximum diversity problem which arises when m elements are to be selected from an n-element population based on inter-element distances. We study problem complexity and propose randomized ...
    • Constrained min-cut replication for K-way hypergraph partitioning 

      Yazici V.; Aykanat, Cevdet (Institute for Operations Research and the Management Sciences (I N F O R M S), 2014)
      Replication is a widely-used technique in information retrieval and database systems for providing fault tolerance and reducing parallelization and processing costs. Combinatorial models based on hypergraph partitioning ...
    • Data dependent worst case bound improving techniques in zero-one programming 

      Oğuz, Osman (Elsevier BV, 1991)
      A simple perturbation of data is suggested for use in conjunction with approximation algorithms for the purpose of improving the available bounds (upper and lower), and the worst case bounds. The technique does not require ...
    • Debris removal during disaster response: a case for Turkey 

      Sahin, H.; Kara, B. Y.; Karasan, O. E. (Elsevier, 2016)
      Debris occurs from the ruin and wreckage of structures during a disaster. Proper removal of debris is of great importance because it blocks roads and prohibits emergency aid teams from accessing disaster-affected regions. ...
    • Dynamic lot sizing for a warm/cold process: heuristics and insights 

      Toy, A. Ö.; Berk, E. (Elsevier, 2013-09)
      We consider the dynamic lot sizing problem for a warm/cold process where the process can be kept warm at a unit variable cost for the next period if more than a prespecified quantity has been produced. Exploiting the optimal ...
    • The dynamic lot-sizing problem with convex economic production costs and setups 

      Kian, R.; Gurler, U.; Berk, E. (Elsevier, 2014-09)
      In this work the uncapacitated dynamic lot-sizing problem is considered. Demands are deterministic and production costs consist of convex costs that arise from economic production functions plus set-up costs. We formulate ...
    • The effect of economies-of-scale on the performance of lot-sizing heuristics in rolling horizon basis 

      Kian, R.; Berk, Emre; Gürler, Ülkü; Rezazadeh, H.; Yazdani, B. (Taylor & Francis, 2020-02-26)
      In this article, we consider the production planning problem in the presence of (dis)economies-of-scale in production costs on a rolling horizon basis with a fixed forecast horizon. We propose variants of three well-known ...
    • Effects of ignorance and information on judgments and decisions 

      Ayton, P.; Önkal D.; McReynolds, L. (Society for Judgment and Decision Making, 2011)
      We compared Turkish and English students’ soccer forecasting for English soccer matches. Although the Turkish students knew very little about English soccer, they selected teams on the basis of familiarity with the team ...
    • Evsel atık toplama ağı tasarımı ve geri kazanım süreçlerinin iyileştirilmesi 

      Aydın, Hande; Başoğlu, Deniz; Demirel, Melih; Güleç, Ali; Palağlu, Ekin; Şimşek, Aslı; Yetiş-Kara, Bahar (TMMOB MAKİNA MÜHENDİSLERİ ODASI, 2008)
      Mevcut sistemin analizi neticesinde problem evsel atık toplama ve ayrıştırma süreçlerinin yüksek maliyetli olması olarak tanımlanmış ve bu süreçler için maliyetleri azaltacak iyileştirme çalışmaları yapılmıştır. Ayrıca ...
    • An exact approach to minimize single machine total weighted tardiness problem with unequal release dates 

      Özdemir, Deniz (Bilkent University, 1998)
      In this research, the problem of scheduling a set of jobs on a single machine to minimize total weighted tardiness with unequal release dates is considered. We present a new dominance rule by considering the time depending ...
    • Match-up scheduling under a machine breakdown 

      Aktürk, M. S.; Görgülü, E. (Elsevier, 1999)
      When a machine breakdown forces a modified flow shop (MFS) out of the prescribed state, the proposed strategy reschedules part of the initial schedule to match up with the preschedule at some point. The objective is to ...
    • Meeting correlated spare part demands with optimal transshipments 

      Çömez, N.; Stecke, K. E.; Çakanyıldırım, M. (IGI Global, 2010)
      This paper studies spare part transshipments between two service part facilities whose demands are correlated. Transshipments are used to reduce severity of part stock outs. Facilities are run by an inventory manager (IM) ...