Browsing Industrial Engineering by Title
Now showing items 195-214 of 217
-
Solving two-stage hybrid flow shop using climbing depth-bounded discrepancy search
(Elsevier, 2011-03)This paper investigates how to adapt a discrepancy-based search method to solve two-stage hybrid flowshop scheduling problems in which each stage consists of several identical machines operating in parallel. The objective ... -
Special issue in humanitarian operations
(Elsevier, 2016-12) -
The Steiner tree problem with delays: a compact formulation and reduction procedures
(Elsevier, 2014-02-19)This paper investigates the Steiner Tree Problem with Delays (STPD), a variation of the classical Steiner Tree problem that arises in multicast routing. We propose an exact solution approach that is based on a polynomial-size ... -
A stochastic optimization model for designing last Mile relief networks
(Informs, 2016-08)In this study, we introduce a distribution network design problem that determines the locations and capacities of the relief distribution points in the last mile network, while considering demand- and network-related ... -
Stochastic production planning with flexible manufacturing systems and uncertain demand: A column generation-based approach
(Elsevier, 2022)The ongoing pandemic, namely COVID-19, has rendered widespread economic disorder. The deficiencies have delayed production at manufacturers in several industries on the supply side. The effects of disruption were more ... -
A stochastic value estimation tool for electric vehicle charging points
(Elsevier, 2021-07-15)A stochastic value estimation tool serves as a planning tool with embedded modules for electrical and financial valuation of electric vehicle charging points. The tool is developed in stochastic nature for selected service ... -
Strength of three MIP formulations for the prize collecting steiner tree problem with a quota constraint
(Elsevier, 2010-08-01)This paper investigates the quota version of the Prize Collecting Steiner Tree Problem (PCSTP) on a graph as a generalization of the well-known Steiner tree problem. For this challenging network design problem that arises ... -
Summary of an effective formulation of the multi-criteria test suite minimization problem
(IEEE, 2022)This is an extended abstract of the article: Okan Orsan Ozener and Hasan Sozer, 'An Effective Formulation of the Multi-Criteria Test Suite Minimization Problem', published in the Journal of Systems and Software, Vol. 168, ... -
Supplier selection and order allocation in the presence of suppliers with exact annual capacity
(Inderscience Enterprises Ltd., 2021)In this paper, we focus on the supplier selection and order quantity allocation for a single retailer. The retailer orders a product from multiple suppliers with capacities, adds value to the product and fulfils the demand ... -
Supplier selection for framework agreements in humanitarian relief
(Wiley, 2014-06)In this study, we consider the supplier selection problem of a relief organization that wants to establish framework agreements (FAs) with a number of suppliers to ensure quick and cost-effective procurement of relief ... -
A survey of adjustable robust optimization
(Elsevier, 2019-09)Static robust optimization (RO) is a methodology to solve mathematical optimization problems with uncertain data. The objective of static RO is to find solutions that are immune to all perturbations of the data in a so-called ... -
Şebeke kaynaklı müşteri şikayetleri için akıllı teşhis ve çözüm sistemleri
(IEEE, 2016)In the telecommunication sector, there exists a vast variety of protocol data (Such as ADR, IUCS, GB, IUPS, GN) produced by signaling systems. The data contains various information regarding network quality and performance. ... -
Tight compact models and comparative analysis for the prize collecting Steiner tree problem
(Elsevier, 2013-03)We investigate a generalized version of the prize collecting Steiner tree problem (PCSTP), where each node of a given weighted graph is associated with a prize as well as a penalty cost. The problem is to find a tree ... -
The traveling salesman problem with pickups, deliveries, and handling costs
(Informs, 2010-08)This paper introduces a new variant of the one-to-many-to-one single vehicle pickup and delivery problems (SVPDP) that incorporates the handling cost incurred when rearranging the load at the customer locations. The ... -
Turkish cashier problem with time windows and its solution by Migrating bird optimization algorithm
(IEEE, 2023)A new application of the traveling salesman problem referred to as the Turkish cashier problem (TCP) was recently introduced in literature. The problem revolved around a cashier that must visit several locations and return ... -
Two classes of quadratic assignment problems that are solvable as linear assignment problems
(Elsevier, 2011-08)The Quadratic Assignment Problem is one of the hardest combinatorial optimization problems known. We present two new classes of instances of the Quadratic Assignment Problem that can be reduced to the Linear Assignment ... -
A two-phase heuristic algorithm for the label printing problem
(Springer, 2023-04)In this paper, we study the label printing problem (LPP) which has applications in the printing industry. In LPP, the demand for a set of labels is satisfied by printing the labels using templates with multiple slots. Given ... -
The value of quality grading in remanufacturing under quality level uncertainty
(Taylor & Francis, 2021)In remanufacturing, variability in quality levels of available cores (end-of-life products) has an impact on both the process cost and the process time. While previous research suggests that quality grading adds value, ... -
A variable neighborhood search based matheuristic for a waste cooking oil collection network design problem
(Elsevier, 2022-10)Households produce large amounts of waste cooking oil (WCO), which should be disposed properly to avoid its negative impacts on the environment. Using WCO as raw material in biodiesel production is an effective disposal ... -
Variable-sized bin packing problem with conflicts and item fragmentation
(Elsevier, 2022-01)In this paper, we study the Variable-Sized Bin Packing Problem with Conflicts and Item Fragmentation (VSBPPC-IF) that has applications such as (i) the delivery planning of incompatible items using a fleet of heterogenous ...
Share this page
