Browsing Industrial Engineering by Issue Date
Now showing items 120 of 119

Detecting credit card fraud by modified Fisher discriminant analysis
(Elsevier, 01.04.2015)In parallel to the increase in the number of credit card transactions, the financial losses due to fraud have also increased. Thus, the popularity of credit card fraud detection has been increased both for academicians and ... 
Energetic reasoning revisited: application to parallel machine scheduling
(Springer Science+Business Media, 200808)We consider the problem of minimizing makespan on identical parallel machines subject to release dates and delivery times. We present several new feasibility tests and adjustment techniques that consistently improve ... 
MathOptimizer: a nonlinear optimization package for mathematica users
(2009)Mathematica is an advanced software system that enables symbolic computing, numerics, program code development, model visualization and professional documentation in a unified framework. Our MathOptimizer software package ... 
Approximation algorithms for single machine scheduling with one unavailability period
(Springer Nature, 200903)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 polynomialtime approximation scheme when ... 
Heuristics for the variable sized binpacking problem
(Elsevier, 200910)We investigate the onedimensional variablesized binpacking problem. This problem requires packing a set of items into a minimumcost set of bins of unequal sizes and costs. Six optimizationbased heuristics for this ... 
Algorithmic expedients for the prize collecting Steiner tree problem
(Elsevier, 2010)This paper investigates the Prize Collecting Steiner Tree Problem (PCSTP) on a graph, which is a generalization of the wellknown Steiner tree problem. Given a root node, edge costs, node prizes and penalties, as well as ... 
Integrated airline schedule design and fleet assignment: polyhedral analysis and benders’ decomposition approach
(Informs, 201001)The main airline operations consist of schedule planning, fleet assignment, aircraft routing, and crew scheduling. To improve profitability, we present in this paper an integrated fleet assignment model with schedule ... 
Discrete time/cost tradeoff problem: a decompositionbased solutionalgorithm for the budget version
(Elsevier, 201004)This paper investigates the budget variant of the discrete time/cost tradeoff problem (DTCTP). This multimode project scheduling problem requires assigning modes to the activities of a project so that the total completion ... 
The attractive traveling salesman problem
(Elsevier, 20100516)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 ... 
Calibrating artificial neural networks by global optimization
(201007)An artificial neural network (ANN) is a computational model − implemented as a computer program − that is aimed at emulating the key features and operations of biological neural networks. ANNs are extensively used to model ... 
The traveling salesman problem with pickups, deliveries, and handling costs
(Informs, 201008)This paper introduces a new variant of the onetomanytoone single vehicle pickup and delivery problems (SVPDP) that incorporates the handling cost incurred when rearranging the load at the customer locations. The ... 
IPbased energetic reasoning for the resource constrained project scheduling problem
(Elsevier, 20100801)In this paper, we consider the Resource Constrained Project Scheduling Problem (RCPSP). New feasibility tests for the energetic reasoning are introduced based on new integer programming (IP) formulations. Experimental ... 
A computational study of lower bounds for the two dimensional bin packing problem
(Elsevier, 20100801)We survey lower bounds for the variant of the twodimensional bin packing problem where items cannot be rotated. We prove that the dominance relation claimed by Carlier et al. between their lower bounds and those of Boschetti ... 
Strength of three MIP formulations for the prize collecting steiner tree problem with a quota constraint
(Elsevier, 20100801)This paper investigates the quota version of the Prize Collecting Steiner Tree Problem (PCSTP) on a graph as a generalization of the wellknown Steiner tree problem. For this challenging network design problem that arises ... 
Robust aircraft routing and flight retiming
(Elsevier, 20100801)In this paper, we propose an integrated model for the robust aircraft routing and flight retiming problem. The model optimizes a slackbased robustness measure that explicitly takes heed of passengers in connection and ... 
Exact method for robotic cell problem
(Elsevier, 20100801)This study investigates an exact method for the Robotic Cell Problem. We present an exact branch and bound algorithm which is the first exact procedure specifically designed for this strongly NPhard problem. In this ... 
An exact algorithm for the Steiner tree problem with delays
(Elsevier, 20100801)The Steiner Tree Problem with Delays (STPD) is a variant of the wellknown Steiner Tree Problem in which the delay on each path between a source node and a terminal node is limited by a given maximum value. We propose a ... 
A branchandcut algorithm for solving the nonpreemptive capacitated swapping problem
(Elsevier, 20100806)This paper models and solves a capacitated version of the NonPreemptive 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 ... 
The onewarehouse multiretailer problem with an orderupto level inventory policy
(Wiley, 201010)We consider a twolevel system in which a warehouse manages the inventories of multiple retailers. Each retailer employs an orderupto level inventory policy over T periods and faces an external demand which is dynamic ... 
Discrepancy search for the flexible job shop scheduling problem
(Elsevier, 201012)The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop problem in which each operation must be processed on a given machine chosen among a finite subset of candidate machines. The aim ...
Share this page