Endüstri Mühendisliği Bölümü Tezleri

Permanent URI for this collectionhttps://hdl.handle.net/20.500.12416/226

Browse

Browsing Endüstri Mühendisliği Bölümü Tezleri by Author "Çankaya Üniveristesi, Fen Bilimleri Enstitüsü, Endüstri Mühendisliği Anabilim Dalı"

Filter results by typing the first few letters
Now showing 1 - 4 of 4
  • Item
    Citation Count: Kılınç, Mehmet Can (2017). Assignment of afad warehouses to container ports in Turkey / Afad depolarının türkiye'deki konteyner limanlarına atanması. Yayımlanmış yüksek lisans tezi. Ankara: Çankaya Üniversitesi Fen Bilimleri Enstitüsü.
    Assignment of afad warehouses to container ports in Turkey
    (Çankaya Üniversitesi, 2017) Kılınç, Mehmet Can; Çankaya Üniveristesi, Fen Bilimleri Enstitüsü, Endüstri Mühendisliği Anabilim Dalı
    The assignment of AFAD warehouses to container ports is a vital topic, but it has not been studied thoroughly in the literature. Turkey is a special case for using maritime transportation in humanitarian logistics, because of the geopolitical location and vulnerability of our country. The main objective of this thesis is to investigate the use of maritime transportation in humanitarian logistics to respond natural disasters effectively for Turkey via the assignment of AFAD warehouses to container ports. In this thesis, a mathematical model for assigning 25 Prime Ministry Disaster and Emergency Management Authority (AFAD in Turkish) logistics warehouses to suitable ports in Turkey is developed. The capabilities of ports to handle humanitarian logistics activities, ports' closeness to AFAD logistics warehouses, suitability of access using different transportation modes and capacities of AFAD logistics warehouses are some of the criteria that is considered in this model. Assignments are also analyzed by taking into consideration of container ports' railway connections availability. The developed approach provides an alternative solution to humanitarian operations in Turkey.
  • Item
    Citation Count: Çağlayan, Nihan (2017). Customer order scheduling on two identical parallel machines with job setup times / Kurulum süreli iki özdeş paralel makinada müşteri siparişi çizelgelemesi. Yayımlanmış yüksek lisans tezi. Ankara: Çankaya Üniversitesi Fen Bilimleri Enstitüsü.
    Customer order scheduling on two identical parallel machines with job setup times
    (Çankaya Üniversitesi, 2017) Çağlayan, Nihan; Çankaya Üniveristesi, Fen Bilimleri Enstitüsü, Endüstri Mühendisliği Anabilim Dalı
    Across all countries, manufacturers seek to adapt the best strategies to provide the highest qualities of services with lowest costs. For that matter, researchers have tried to develop better shop structures that in fact influenced and even can be controlled by a single machine, parallel machines and flow shop matters alongside with setup considerations. They especially put forwarded several approaches to scheduling by focusing on making certain alterations on setup timings of job assignments to achieve the best time saving and eventually the lowest cost. Studies on setup times or costs showed that, running the grouped jobs with the same or similar setup needs dramatically reduces both the setup times and costs. This procedure can also be classified as group technology and customer order scheduling (COS). The focus of this thesis is to provide an alternative scheduling for customer orders that may contain one or more than one job lots within two identical parallel machines. The common belief of any customer order is very straightforward which in fact requires its orders' to be proceed at the same time with a prompt attitude so that all job lot can be received with a well synchronization. The completion time of the last set of each customer order also indicates the completed duration of the customer order. Obviously, each job batch requires some certain setup arrangements unless setup needs of current job assignment match with upcoming assignment's setup needs. This study is an attempt to suggest a more time saving and low costing schedule by grouping and running customer orders with same setup requirements at most appropriate route via two identical parallel machines so as to reduce makespan time to present customers their orders in best optimized way. The existing problem has more than one variety; e.g., customer orders may contain more than one job assignment or orders may have different setup arrangements and times, etc. In such complex cases, it is fair to say that the problem is strongly NP-hard. MILP is practiced to solve optimal to small sized problems whereas a constructive algorithm is conducted to handle medium and large sized problems in order to get optimal and/or near-optimal solutions. GAMS, the optimization software for mathematical programming model is used to get optimum results. The heuristic algorithm is coded by computer language C++. In result of computational experiments, it was found that the mathematical model is inadequate to cover or may even fail to acquire solutions for especially medium and large sized problems.
  • Item
    Citation Count: Yozgat, Simge (2017).Pricing and remanufacturing decisions with speculators and strategic consumers / Spekülatörler ve stratejik müşteriler ile fiyatlandırma ve yeniden imalat kararları. Yayımlanmamış yüksek lisans tezi. Ankara: Çankaya Üniversitesi Fen Bilimleri Enstitüsü.
    Pricing and remanufacturing decisions with speculators and strategic consumers
    (Çankaya Üniversitesi, 2017) Yozgat, Simge; Çankaya Üniveristesi, Fen Bilimleri Enstitüsü, Endüstri Mühendisliği Anabilim Dalı
    We investigate pricing and remanufacturing decisions with speculators and strategic consumers for a single type of a product over a two-period sales horizon. A monopolist manufacturer produces a fixed quantity in the first period. Some of the sold products are returned at the end of the first period, which are collected by the manufacturer and/or speculators. Returned products are remanufactured, and then sold in the second period, along with any new products remaining from the first period. Mathematical models take into account the behavioral patterns of different types of customers to maximize the manufacturer's expected total profit. Solution to the mathematical models show that one particular customer behavior is optimal. Specifically, the manufacturer should use a fixed-pricing policy for all products –new and remanufactured alike– and set the price at the maximum level that strategic customers are willing to buy. This will force customers to wait for the second period to buy any products, and hence, will yield the maximum profit for the manufacturer. Additionally, the manufacturer is better off remanufacturing. The sensitivity analysis has shown that the profit is most sensitive to the number of strategic customers.
  • Item
    Citation Count: Türüdü, Özgün (2017). Regional coverage of science centers in Turkey / Türkiye'de bilim merkezlerinin bölgesel kapsaması. Yayımlanmamış yüksek lisans tezi. Ankara: Çankaya Üniversitesi Fen Bilimleri Enstitüsü.
    Regional coverage of science centers in Turkey
    (Çankaya Üniversitesi, 2017) Türüdü, Özgün; Çankaya Üniveristesi, Fen Bilimleri Enstitüsü, Endüstri Mühendisliği Anabilim Dalı
    In 2011, Turkish Supreme Council for Science and Technology decided to establish Science Centers with TÜBİTAK's support in all the metropolitan municipalities by 2016 and in all provinces of Turkey by 2023. Since the budgets of Science Centers are high and they are attracting visitors from other provinces, an additional decision was taken in 2016 to establish Science Centers in prioritized regional centers. The objective of this thesis is to determine the locations of Science Centers in Turkey considering the new criteria defined in the additional decision using integer and mixed integer programming models such as p-median, p-dispersion, and a multicriteria model. A hybrid model was proposed to utilize p-median and multicriteria model together. P-median model and hybrid model take into consideration population density of provinces' and distance criteria. P-dispersion model, and the multicriteria approach take into consideration only the distance criterion. Location of existing five science centers are included in all models. Models are solved for varying p (e.g. number of science centers) values of 5, 10, 13, 15, 20, 25 and 30. Four performance criteria were determined and solutions of the models are compared to each other. Cities selected using different models are compared. To the best of our knowledge, this thesis is the first study about science center location problem in the literature.