Browsing Industrial Engineering by Title
Now showing items 6-25 of 216
-
Allocating cost of service to customers in inventory routing
(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
(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
(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
(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
(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
(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
(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
(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
(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
(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
(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
(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
(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
(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
(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 ... -
A branch-and-cut algorithm for the Steiner tree problem with delays
(Springer Science+Business Media, 2012-12)In this paper, we investigate the Steiner tree problem with delays, which is a generalized version of the Steiner tree problem applied to multicast routing. For this challenging combinatorial optimization problem, we present ... -
Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times
(Elsevier, 2022-09-16)This paper studies a machine scheduling problem that minimizes the worst-case total tardiness for unrelated parallel machines with sequence-dependent setup and uncertain processing times. We propose a robust optimization ... -
A branch-and-price-and-cut method for computing an optimal bramble
(Elsevier, 2015)Given an undirected graph, a bramble is a set of connected subgraphs (called bramble elements) such that every pair of subgraphs either contains a common node, or such that an edge ( i , j ) exists with node i belonging ... -
A branch‐and‐cut approach for the least cost influence problem on social networks
(Wiley, 2020-07)This paper studies a problem in the online targeted marketing setting called the least cost influence problem (LCIP) that is known to be NP-hard. The goal is to find the minimum total amount of inducements (individuals to ... -
Broadband high power amplifier design using GaN HEMT technology
(IEEE, 2021)This paper presents the design and measurements of a broadband GaN HEMT power amplifier intended for point-to-point radios, electronic warfare systems, and test and measurement applications. The proposed power amplifier ...
Share this page
