Browsing Industrial Engineering by Author "Özyeğin University"
Now showing items 1-20 of 215
-
Adapted infinite kernel learning by multi-local algorithm
Özöğür Akyüz, S.; Üstünkar, Gürkan; Weber, G. W. (World Scientific Publishing Co, 2016-05)The interplay of machine learning (ML) and optimization methods is an emerging field of artificial intelligence. Both ML and optimization are concerned with modeling of systems related to real-world problems. Parameter ... -
Advancing home healthcare through machine learning: Predicting service time for enhanced patient care
Selçuk, Yağmur Selenay; Göktürk, Elvin Çoban (IEEE, 2023)Providing healthcare services at home is crucial for patients who require long-term care or face mobility or other health-related constraints that prevent them from traveling to healthcare facilities. Effective data analysis ... -
Agile performance indicators for team performance evaluation in a corporate environment
Ertaban, Cihangir; Sarıkaya, E.; Bağrıyanık, S. (The ACM Digital Library, 2018)Software development is a must for almost all industries including services, production, health and even construction. Being so widespread, software development industry needs metrics for especially two reasons; performance ... -
Aid allocation for camp-based and urban refugees with uncertain demand and replenishments
Azizi, S.; Bozkır, Cem Deniz Çağlar; Trapp, A. C.; Kundakcıoğlu, Ömer Erhun; Kurbanzade, Ali Kaan (Wiley, 2021-12)There are 26 million refugees worldwide seeking safety from persecution, violence, conflict, and human rights violations. Camp-based refugees are those that seek shelter in refugee camps, whereas urban refugees inhabit ... -
Algorithmic expedients for the prize collecting Steiner tree problem
Haouari, Mohamed; Layeb, S. B.; Sherali, H. D. (Elsevier, 2010)This paper investigates the Prize Collecting Steiner Tree Problem (PCSTP) on a graph, which is a generalization of the well-known Steiner tree problem. Given a root node, edge costs, node prizes and penalties, as well as ... -
Allocating cost of service to customers in inventory routing
Özener, Okan Örsan; Ergun, Ö.; Savelsbergh, M. (Informs, 2013)Vendor-managed inventory VMI replenishment is a collaboration between a supplier and its customers, where the supplier is responsible for managing the customers' inventory levels. In the VMI setting we consider, the supplier ... -
Application of sequence-dependent traveling salesman problem in printed circuit board assembly
Alkaya, A. F.; Duman, Ekrem (IEEE, 2013-06)Optimization issues regarding the automated assembly of printed circuit boards attracted the interest of researchers for several decades. This is because even small gains in assembly time result in very important benefits ... -
An application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel Electronics
Ekici, Ali; Elyasi, Milad; Özener, Okan Örsan; Sarıkaya, M. B. (Elsevier, 2019-11)In this paper, we analyze a variant of the unrelated parallel machine scheduling problem with the objective of minimizing the total tardiness and earliness in the presence of sequence-dependent setups, unequal release ... -
Applying migrating birds optimization to credit card fraud detection
Elikucuk, I.; Duman, Ekrem (Springer Science+Business Media, 2013)We discuss how the Migrating Birds Optimization algorithm (MBO) is applied to statistical credit card fraud detection problem. MBO is a recently proposed metaheuristic algorithm which is inspired by the V flight formation ... -
An approach for predicting employee churn by using data mining
Yiğit, İ. O.; Shourabizadeh, Hamed (IEEE, 2017)Employee churn prediction which is closely related to customer churn prediction is a major issue of the companies. Despite the importance of the issue, there is few attention in the literature about. In this study, we ... -
Approximation algorithms for single machine scheduling with one unavailability period
Kacem, I.; Haouari, Mohamed (Springer Nature, 2009-03)In this paper, we investigate the single machine scheduling problem with release dates and tails and a planned unavailability time period. We show that the problem admits a fully polynomial-time approximation scheme when ... -
The attractive traveling salesman problem
Erdoğan, Güneş; Cordeau, J.-F.; Laporte, G. (Elsevier, 2010-05-16)In the Attractive Traveling Salesman Problem the vertex set is partitioned into facility vertices and customer vertices. A maximum profit tour must be constructed on a subset of the facility vertices. Profit is computed ... -
Benchmarking nonlinear optimization software in technical computing environments
Pinter, Janos D.; Kampas, F. J. (Springer Science+Business Media, 2013-04)Our strategic objective is to develop a broadly categorized, expandable collection of test problems, to support the benchmarking of nonlinear optimization software packages in integrated technical computing environments ... -
Benchmarking regression algorithms for income prediction modeling
Kibekbaev, Azamat; Duman, Ekrem (Elsevier, 2016)This paper aims to predict incomes of customers for banks. In this large-scale income prediction benchmarking paper, we study the performance of various state-of-the-art regression algorithms (e.g. ordinary least squares ... -
Benchmarking regression algorithms for income prediction modeling
Kibekbaev, Azamat; Duman, Ekrem (IEEE, 2015)This paper aims to predict incomes of customers for banks. In this large-scale income prediction benchmarking paper, we study the performance of various state-of-the-art regression algorithms (e.g. ordinary least squares ... -
A benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture
Sherali, H. D.; Bae, K.-H.; Haouari, Mohamed (Springer Science+Business Media, 2013-11)The airline’s ability to offer flight schedules that provide service to passengers at desired times in competitive markets, while matching demand with an aircraft fleet of suitable size and composition, can significantly ... -
Bin packing problem with conflicts and item fragmentation
Ekici, Ali (Elsevier, 2021-02)In this paper, we study the Bin Packing Problem with Conflicts and Item Fragmentation (BPPC-IF) which has applications in the delivery and storage of items that cannot be packed together. Given a set of items each with a ... -
Blood supply chain management and future research opportunities
Ekici, Ali; Özener, Okan Örsan; Göktürk, Elvin Çoban (Springer, 2018)In this chapter, we discuss the challenges and research opportunities in the blood collection operations and explore the benefits of recent advances in the blood donation process. According to the regulations, donated blood ... -
Bounding strategies for the hybrid flow shop scheduling problem
Hidri, L.; Haouari, Mohamed (Elsevier, 2011-07-01)In this paper, we investigate new lower and upper bounds for the multiple-center hybrid flow shop scheduling problem. We propose a family of center-based lower bounds as well as a destructive lower bound that is based on ... -
A branch-and-cut algorithm for solving the non-preemptive capacitated swapping problem
Erdoğan, Güneş; Cordeau, J.-F.; Laporte, G. (Elsevier, 2010-08-06)This paper models and solves a capacitated version of the Non-Preemptive Swapping Problem. This problem is defined on a complete digraph , at every vertex of which there may be one unit of supply of an item, one unit of ...
Share this page