Endüstri Mühendisliği Bölümü Yayın Koleksiyonu
Permanent URI for this collectionhttps://hdl.handle.net/20.500.12416/279
Browse
5 results
Search Results
Article Citation - Scopus: 8A Partial Coverage Hierarchical Location Allocation Model for Health Services(Inderscience Publishers, 2023) Karasakal, O.; Karasakal, E.; Töreyen, Ö.We consider a hierarchical maximal covering location problem (HMCLP) to locate health centres and hospitals so that the maximum demand is covered by two levels of services in a successively inclusive hierarchy. We extend the HMCLP by introducing the partial coverage and a new definition of the referral. The proposed model may enable an informed decision on the healthcare system when dynamic adaptation is required, such as a COVID-19 pandemic. We define the referral as coverage of health centres by hospitals. A hospital may also cover demand through referral. The proposed model is solved optimally for small problems. For large problems, we propose a customised genetic algorithm. Computational study shows that the GA performs well, and the partial coverage substantially affects the optimal solutions. © 2023 Inderscience Enterprises Ltd.Article A Partial Coverage Hierarchical Location Allocation Model for Health Services(inderscience Enterprises Ltd, 2023) Karasakal, Esra; Toreyen, Ozgun; Karasakal, OrhanWe consider a hierarchical maximal covering location problem (HMCLP) to locate health centres and hospitals so that the maximum demand is covered by two levels of services in a successively inclusive hierarchy. We extend the HMCLP by introducing the partial coverage and a new definition of the referral. The proposed model may enable an informed decision on the healthcare system when dynamic adaptation is required, such as a COVID-19 pandemic. We define the referral as coverage of health centres by hospitals. A hospital may also cover demand through referral. The proposed model is solved optimally for small problems. For large problems, we propose a customised genetic algorithm. Computational study shows that the GA performs well, and the partial coverage substantially affects the optimal solutions. [Submitted: 20 January 2021; Accepted: 15 January 2022]Article Citation - Scopus: 23Using Announcement Options in the Bid Construction Phase for Disaster Relief Procurement(2012) Ertem, M.A.; Buyurgan, N.; Pohl, E.A.This paper presents an analysis of the bid construction phase of procurement auctions in disaster relief and humanitarian logistics. Substitution and partial fulfillment options are presented in formulations to allow bidders with fewer inventories to offer substitute item types and partial bids in auctions. During the auction announcement phase, a coordinating platform for disaster locations (i.e., auctioneer) allows substitution and partial fulfillment options to the relief suppliers (i.e., bidders) when acceptable. Thus, suppliers with fewer inventories can offer substitute item types and participate in more auctions by partially bidding. A genetic algorithm, a simulated annealing algorithm and an integer program are used for the analysis of the bid construction phase with different announcement options. Heuristic solution techniques and an IP formulation help understand the dynamics of the bid construction problem. It is shown that the addition of substitution and partial fulfillment options is essential to diversify and increase the usable capacity of the supplier base. Additionally, the partial fulfillment option enables better usage of supplier inventories in an environment with scarce supplies. © 2012 Elsevier Ltd.Article Citation - WoS: 9Citation - Scopus: 13Multi-Item Two-Echelon Spare Parts Inventory Control Problem With Batch Ordering in the Central Warehouse Under Compound Poisson Demand(Palgrave Macmillan Ltd, 2012) Bayindir, Z. P.; Topan, E.We consider a multi-item two-echelon spare part inventory system in which the central warehouse operates under an (nQ, R) policy and the local warehouses implement order-up-to S policy, each facing a compound Poisson demand. The objective is to find the policy parameters minimizing expected system-wide inventory holding and fixed ordering costs subject to an aggregate mean response time constraint at each warehouse. In this paper, we propose four alternative approximations for the steady state performance of the system; and extend a heuristic and a lower bound proposed under Poisson demand assumption to the compound Poisson setting. In a computational study, we show that the performances of the approximations, the heuristic, and the lower bound are quite satisfactory; and the relative cost saving of setting an aggregate service level rather than individually for each part is quite high. Journal of the Operational Research Society (2012) 63, 1143-1152. doi: 10.1057/jors.2011.125 Published online 30 November 2011Article Citation - WoS: 5Citation - Scopus: 8Lp Relaxation-Based Solution Algorithms for the Multi-Mode Project Scheduling With a Non-Renewable Resource(inderscience Enterprises Ltd, 2015) Cetinkaya, Ferda Can; Pamir, Selin Kirbiyik; Azizoglu, MeralIn this study, we consider a multi-mode resource allocation problem with a single non-renewable resource. We assume the resource is released at defined time points and at defined quantities. We also assume that the activity costs are charged once they are completed. Our aim is to minimise the project completion time. We formulate the problem as a pure integer programming model and show that it is strongly NP-hard. We find lower bounds by pure and mixed integer linear programming relaxations of the model and develop three heuristic procedures based on those relaxations. The results of our computational study have revealed the satisfactory performances of our lower bounds and heuristic procedures.