Now showing items 1-20 of 22

    • Age-based vs. stock level control policies for a perishable inventory system 

      Tekin, E.; Gürler Ü.; Berk, E. (2001)
      In this study, we investigate the impact of modified lotsize-reorder control policy for perishables which bases replenishment decisions on both the inventory level and the remaining lifetimes of items in stock. We derive ...
    • Analysis of reactive scheduling problems in a job shop environment 

      Sabuncuoğlu, İ.; Bayız, M. (Elsevier, 2000)
      In this paper, we study the reactive scheduling problems in a stochastic manufacturing environment. Specifically, we test the several scheduling policies under machine breakdowns in a classical job shop system. In addition, ...
    • 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 ...
    • An approach to manage connectionless services in connection-oriented networks 

      Arıkan, E.; Abdelatı, M. (IEEE (Institute of Electrical and Electronics Engineers), 1996)
      In this work we propose a pricing scheme which serves as an instrument for managing connectionless services in connection-oriented communication networks. The scheme is able to allocate network bandwidth in a Pareto-optimal ...
    • Customer order scheduling problem: a comparative metaheuristics study 

      Hazır, Ö.; Günalay, Y.; Erel, E. (Springer, 2007)
      The customer order scheduling problem (COSP) is defined as to determine the sequence of tasks to satisfy the demand of customers who order several types of products produced on a single machine. A setup is required whenever ...
    • A data mining approach for location prediction in mobile environments 

      Yavaş G.; Katsaros, D.; Ulusoy, Ö.; Manolopoulos, Y. (Elsevier, 2005)
      Mobility prediction is one of the most essential issues that need to be explored for mobility management in mobile computing systems. In this paper, we propose a new algorithm for predicting the next inter-cell movement ...
    • The discrete resource allocation problem in flow lines 

      Karabati, S.; Kouvelis, P.; Yu, G. (Institute for Operations Research and the Management Sciences (INFORMS), 1995)
      In this paper we address the discrete resource allocation problem in a deterministic flow line. We assume that the processing times are convex and noningcreasing in the amount of resources allocated to the machines. We ...
    • Energy efficient dynamic virtual machine allocation with cpu usage prediction in cloud datacenters 

      Urul, Gökalp (Bilkent University, 2018-01)
      With tremendous increase in Internet capacity and services, the demand for cloud computing has also grown enormously. This enormous demand for cloud based data storage and processing forces cloud providers to optimize ...
    • The general behavior of pull production systems: the allocation problems 

      Kırkavak, N.; Dinçer, C. (Elsevier, 1999)
      The design of tandem production systems has been well studied in the literature with the primary focus being on how to improve their e ciency. Considering the large costs associated, a slight improvement in e ciency can ...
    • Improving performance of sparse matrix dense matrix multiplication on large-scale parallel systems 

      Acer, S.; Selvitopi, O.; Aykanat, C. (Elsevier BV, 2016)
      We propose a comprehensive and generic framework to minimize multiple and different volume-based communication cost metrics for sparse matrix dense matrix multiplication (SpMM). SpMM is an important kernel that finds ...
    • Investing in quality under autonomous and induced learning 

      Serel, D. A.; Dada, M.; Moskowitz, H.; Plante, R. D. (Taylor & Francis, 2003)
      The reduction of variability in product performance characteristics is an important focus of quality improvement programs. Learning is intrinsically linked to process improvement and can assume two forms: (i) autonomous ...
    • Marginal allocation algorithm for nonseparable functions 

      Yüceer, Ü. (Taylor & Francis, 1999)
      Marginal allocation algorithm is implemented to discrete allocation problems with nonseparable objective functions subject to a single linear constraint. A Lagrangian analysis shows that the algorithm generates a sequence ...
    • Network hub location problems: The state of the art 

      Alumur, S.; Kara, B. Y. (Elsevier, 2008)
      Hubs are special facilities that serve as switching, transshipment and sorting points in many-to-many distribution systems. The hub location problem is concerned with locating hub facilities and allocating demand nodes to ...
    • Online balancing two independent criteria 

      Tse, Savio S.H. (Springer, 2008-10)
      We study the online bicriteria load balancing problem in this paper. We choose a system of distributed homogeneous file servers located in a cluster as the scenario and propose two online approximate algorithms for balancing ...
    • Online bicriteria load balancing for distributed file servers 

      Tse, S. (IEEE, 2008)
      We study the online bicriteria load balancing problem in a system of M distributed homogeneous file servers located in a cluster. The load and storage space are assumed to be independent. We propose two online approximate ...
    • Online solutions for scalable file server systems 

      Tse, S.S.H. (2006)
      We propose three online algorithms for scalable file server systems. A scalable file server is expected to provide rather stable services while the numbers of users, tasks, and data volumes keep increasing. One of the ...
    • Reactive scheduling in a dynamic and stochastic FMS environment 

      Sabuncuoğlu, İ.; Kızılışık, Ö. B. (Taylor & Francis, 2003)
      In this paper, we study the reactive scheduling problems in a dynamic and stochastic manufacturing environment. Specifically, we develop a simulationbased scheduling system for flexible manufacturing systems. We also propose ...
    • A Recursive Hypergraph Bipartitioning Framework for Reducing Bandwidth and Latency Costs Simultaneously 

      Selvitopi, O.; Acer, S.; Aykanat, C. (IEEE Computer Society, 2017)
      Intelligent partitioning models are commonly used for efficient parallelization of irregular applications on distributed systems. These models usually aim to minimize a single communication cost metric, which is either ...
    • The resource curse and child mortality, 1961–2011 

      Wigley, S. (Elsevier Ltd, 2017)
      There is now an extensive literature on the adverse effect of petroleum wealth on the political, economic and social well-being of a country. In this study we examine whether the so-called resource curse extends to the ...
    • Shortest-route formulation of mixed-model assembly line balancing problem 

      Erel, E.; Gokcen, H. (Elsevier, 1999)
      A shortest-route formulation of the mixed-model assembly line balancing problem is presented. Common tasks across models are assumed to exist and these tasks are performed in the same stations. The formulation is based on ...