Browsing by Author "Cavdur, Fatih"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    Determination of relief supplies demands and allocation of temporary disaster response facilities
    (Elsevier, 2017) Sebatlı, Aslı; Cavdur, Fatih; Köse, Küçük Merve; Uludağ Üniversitesi/Mühendislik Fakültesi/Endüstri Mühendisliği Bölümü.; 0000-0002-9445-6740; 0000-0001-8054-5606; 0000-0001-6877-2937; AAE-4504-2019; AAG-9471-2021; AAC-2099-2020; 57191223084; 8419687000; 57191227592
    Distribution of relief supplies and allocation of the facilities to store these supplies are important pre-and post-Disaster Operations Management (DOM) activities. In this study, we propose a simulation-based approach to determine the demands of relief supplies until the governmental and/or central humanitarian organizations (i.e., the Turkish Red Crescent-TRC) reach to the affected area. We then develop a plan to allocate the so-called temporary-disaster-response (TDR) facilities and distribute the relief supplies stored in these facilities. An earthquake case study is constructed for the Yildirim district of Bursa-Turkey including 64 neighborhoods. Corresponding relief supplies demands are determined by analyzing the time it takes for the TRC to reach the affected area using the simulation model with two different system designs. The two-phase integer program is then used to develop a pre-positioning plan, i.e., allocation of TDR facilities and distribution of relief supplies.
  • No Thumbnail Available
    Publication
    Solving the unrelated parallel batch machine scheduling problem with mixed-integer programming
    (Gazi Üniversitesi, 2021-12-31) Bakir, Merve; Sebatli-Saglam, Asli; Cavdur, Fatih; ÇAVDUR, FATİH; Bursa Uludağ Üniversitesi/Mühendislik Fakültesi.; 0000-0003-3300-8773; 0000-0002-9445-6740; JYP-7925-2024; AAC-2099-2020
    In this study, the problem of scheduling jobs with arbitrary sizes and non-zero release times on a set of unrelated parallel batch processing machines with different capacities is discussed. Three mixed-integer programming models with different objective functions are developed to solve the problem. Corresponding models aim at minimizing (i) the total flow time, (ii) the makespan and (iii) the total tardiness, respectively, which are considered to be among the most important objectives in scheduling problems. In order to test the validity and applicability of the proposed solution approach, different datasets are generated using some rules in the literature. The results obtained by solving the mathematical programming models with these data sets are analyzed in terms of some performance parameters.