Now showing items 1-20 of 393

    • Design and analysis of just-in-time production systems 

      Oğuz, Ceyda (Bilkent University, 1988)
      Just-in-Time (JIT) production systems have initially appeared in the Japanese manufacturing environment due to the scarcity of their critical resources. The main aim in JIT production systems is to eliminate waste. ...
    • Sensitivity analysis of distance constraints and of multifacility minimax location on tree networks 

      Doğan, Esra (Bilkent University, 1989)
      In this thesis, the main concern is to investigate the use of consistency conditions of distance constraints in sensitivity analysis of certain network location problems. The interest is in minimax type of objective ...
    • A New approach in the maximum flow problem 

      Eren, Aysen (Bilkent University, 1989)
      In this study, we tried to approach the maximum flow problem from a different point of view. This effort has led us to the development of a new maximum flow algorithm. The algorithm is based on the idea that when ...
    • Price dependent procurement decisions in one-period inventory problem 

      Polatoğlu, Hakan (Bilkent University, 1989)
      In this work the classical newsboy model is extended by introducing a price dependent demand pattern. It is intended to obtain optimal procurement and pricing decisions for maximizing the expected profit. It is shown ...
    • Part family machine group formation problem in cellular manufacturing systems 

      Kandiller, Levent (Bilkent University, 1989)
      The first and the most important stage in the design of Cellular Manufacturing (CM) systems is the Part Family Machine Group Formation (PF/MGF) problem. In this thesis, different approaches to the PF/MG-F problem are ...
    • Unit demands inventory system with acceptance sampling 

      Akbaş, Zeki (Bilkent University, 1989)
      In this study, an extension to the unit demands inventory model with exponentially distributed interdemand times is considered. In this extension orders may arrive in two shipments due to an acceptance sampling scheme. ...
    • Two new algorithms for the linear assignment problem 

      Ekin, Oya (Bilkent University, 1990)
      The linear assignment problem (AP) being among the first linear programming problems to be studied extensively,, is a fundamental problem in combinatorial optimization and network flow theory. AP arises in numerous ...
    • Simplex Tableau based approximate projection in Karmarkar's algorithm 

      Günalay, Yavuz (Bilkent University, 1990)
      In this thesis, our main concern is to develop a new implementation of Karmarkar’s LP Algorithm and compare it with the standard version. In the implementation, the “Simplex Tableau” information is used in the basic step ...
    • Solution of feasibility problems via non-smooth optimization 

      Ouveysi, Iradj (Bilkent University, 1990)
      In this study we present a penalty function approach for linear feasibility problems. Our attempt is to find an eiL· coive algorithm based on an exterior method. Any given feasibility (for a set of linear inequalities) ...
    • Analytical loading models and control strategies in flexible manufacturing systems: a comparative study 

      Kırkavak, Nureddin (Bilkent University, 1990)
      There are three problem areas in designing and implementing a manufacturing line : the part family selection and grouping, system configuration and toolings and the operational control of manufacturing. The manufacturing ...
    • Manufacturing flexibility in the justification of advanced automation investments 

      Çetinkaya, Sıla (Bilkent University, 1991)
      A substantial amount of literature pertaining to flexibility has accumulated over the last decade. Nevertheless, there are several strategically important issues underlying this concept which are not understood properly, ...
    • A successive algorithm for the Chinese Postman Problem 

      Narin, Noyan (Bilkent University, 1991)
      The Chinese Postman Problem being one of the well known problems in combinatorial optimization has many applications in real life problems such as mail delivery, road maintenance and bus scheduling. In this thesis work, ...
    • The distribution of the residual lifetime and its applications 

      Çağlar, Mine Alp (Bilkent University, 1991)
      Let T be a continuous positive random variable representing the lifetime of an entitle This entity could be a human being, an animal or a plant, or a component of a mechanical or electrical system. For nonliving objects ...
    • Some heuristics as preprocessing for 0-1 integer programming 

      Yılmaz, Fatih (Bilkent University, 1991)
      It is well-known that 0-1 integer programming is one of the hard problems to solve other than special cases of constraint set in mathematical programming. In this thesis, some preprocessing will be done to get useful ...
    • The analytic hierarchy process applied to the justification of advanced manufacturing systems 

      Urhan, Kubilay Ediz (Bilkent University, 1991)
      In this thesis, a multi-attribute decision model for the justification of advanced manufacturing systems by use of Analytic Hierarchy Process is developed. The model constructed is a general model which can be applied ...
    • Design and implementation of an MRP-II system in electronics industry 

      Cankat, A Burç (Bilkent University, 1991)
      Manufacturing Resource Planning (MRP II) system is a modern production planning and control method that is relatively new in our country. In today's competitive and continuously improving industrial scene MRP II ...
    • A comparative study of computational procedures for resource constrained project scheduling problem 

      Bala, Hasan (Bilkent University, 1991)
      Customarily, the project sclheduling problem is thought in the context of PERT and CPM. Although widely used and powerful, these techniques do not take into account a basic feature of the problem, that is resource limitations. ...
    • Minimizing schedule length on identical parallel machines: an exact algorithm 

      Akyel, H. Cemal (Bilkent University, 1991)
      The primary concern of this study is to investigate the combinatorial aspects of the single-stage identical parallel machine scheduling problem and to develop a computationally feasible branch and bound algorithm for its ...
    • Mathematical models of evolution 

      Özaktaş, Hakan (Bilkent University, 1992)
      Two categories of evolutionary models are analyzed. The first category is the so-called autogenesis phenomenon. The emergence of self-organization, which has been discussed previously by Csanyi and Kampis is verified. ...
    • A polyhedral approach to delivery man problem 

      Keskinocak, Pınar (Bilkent University, 1992)
      In this thesis we discuss some polyhedral approaches to the Delivery Man Problem(DMP),which is a special case of the Traveling .Scvlesman Problem(TSP). First, we look at two formulations of the problem and describe a ...