Browsing Department of Industrial Engineering by Title
Now showing items 305-324 of 663
-
Job shop scheduling with beam search
(Elsevier Science B.V., Amsterdam, Netherlands, 1999)Beam Search is a heuristic method for solving optimization problems. It is an adaptation of the branch and bound method in which only some nodes are evaluated in the search tree. At any level, only the promising nodes are ... -
Joint cell loading and scheduling approach to cellular manufacturing systems
(Taylor & Francis, 2011-01-31)A hierarchical multi-objective heuristic algorithm and pricing mechanism are developed to first determine the cell loading decisions, and then lot sizes for each item and to obtain a sequence of items comprising the group ... -
Joint decisions on inventory replenishment and emission reduction investment under different emission regulations
(Taylor & Francis, 2014-09-16)Carbon emission regulation policies have emerged as mechanisms to control firms’ carbon emissions. To meet regulatory requirements, firms can make changes in their production planning decisions or invest in green technologies. ... -
Joint gateway selection, transmission slot assignment, routing and power control for wireless mesh networks
(Elsevier, 2013-07)Wireless mesh networks (WMNs) provide cost effective solutions for setting up a communications network over a certain geographic area. In this paper, we study strategic problems of WMNs such as selecting the gateway nodes ... -
Joint lot sizing and tool management in a CNC environment
(Elsevier, 1999)We propose a new algorithm to solve lot sizing, tool allocation and machining conditions optimization problems simultaneously to minimize total production cost in a CNC environment. Most of the existing lot sizing and tool ... -
Joint mixability of some integer matrices
(Elsevier B.V.Elsevier BV, 2016)We study the problem of permuting each column of a given matrix to achieve minimum maximal row sum or maximum minimal row sum, a problem of interest in probability theory and quantitative finance where quantiles of a random ... -
A joint production and transportation planning problem with heterogeneous vehicles
(2014)We consider a manufacturer's planning problem to schedule order production and transportation to respective destinations. The manufacturer in this setting can use two vehicle types for outbound shipments. The first type ... -
A joint replenishment policy with individual control and constant size orders
(Taylor & Francis, 2010)We consider inventory systems with multiple items under stochastic demand and jointly incurred order setup costs. The problem is to determine the replenishment policy that minimises the total expected ordering, inventory ... -
k-node-disjoint hop-constrained survivable networks: polyhedral analysis and branch and cut
(Springer-Verlag France, 2018)Given a graph with weights on the edges, a set of origin and destination pairs of nodes, and two integers L ≥ 2 and k ≥ 2, the k-node-disjoint hop-constrained network design problem is to find a minimum weight subgraph of ... -
A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem
(Elsevier, 2007)Video on demand (VoD) is a technology used to provide a number of programs to a number of users on request. In developing a VoD system, a fundamental problem is load balancing, which is further characterized by optimally ... -
Large scale linear programs and heuristics for the design of survivable telecommunication networks
(Springer New York LLC, 2003)We consider the problem of providing a minimum cost multi-service network subject to one link failure scenarios. We assume our network is fully meshed and demand is satisfied by using direct or two hop-paths. We provide a ... -
The latest arrival hub location problem
(Institute for Operations Research and the Management Sciences (INFORM), 2001)The traditionally studied hub location problems in the literature pay attention to flight times but not to transient times spent at hubs for unloading, loading, and sorting operations. The transient times may constitute a ... -
The latest arrival hub location problem for cargo delivery systems with stopovers
(Elsevier, 2007)In this paper, we concentrate on the service structure of ground-transportation based cargo delivery companies. The transient times that arise from nonsimultaneous arrivals at hubs (typically spent for unloading, loading, ... -
The linear assignment problem
(Springer, 1992)We present a broad survey of recent polynomial algorithms for the linear assignment problem. They all use essentially alternating trees and/or strongly feasible trees. Most of them employ Dijkstra’s shortest path algorithm ... -
Linear huber M-estimator under ellipsoidal data uncertainty
(Springer, 2002)The purpose of this note is to present a robust counterpart of the Huber estimation problem in the sense of Ben-Tal and Nemirovski when the data elements are subject to ellipsoidal uncertainty. The robust counterparts are ... -
Linear inequalities among graph invariants: using graPHedron to uncover optimal relationships
(John Wiley & Sons, 2008)Optimality of a linear inequality in finitely many graph invariants is defined through a geometric approach. For a fixed number of graph vertices, consider all the tuples of values taken by the invariants on a selected ... -
Linear programming via a quadratic penalty function
(Physica - Verlag, 1996)We use quadratic penalty functions along with some recent ideas from linear l1 estimation to arrive at a new characterization of primal optimal solutions in linear programs. The algorithmic implications of this analysis ... -
A linearly convergent linear-time first-order algorithm for support vector classification with a core set result
(Institute for Operations Research and the Management Sciences (I N F O R M S), 2011)We present a simple first-order approximation algorithm for the support vector classification problem. Given a pair of linearly separable data sets and. ε (0,1), the proposed algorithm computes a separating hyperplane whose ... -
A load-based and due-date-oriented approach to order review release in job shops
(Wiley-Blackwell Publishing, 2000)In this paper, a new order review/release (ORR) method is proposed for shop floor control systems. The proposed method utilizes both job due date and shop load information to improve the effectiveness of the ORR function ... -
A local search heuristic with self-tuning parameter for permutation flow-shop scheduling problem
(IEEE, 2009)In this paper, a new local search metaheuristic is proposed for the permutation flow-shop scheduling problem. In general, metaheuristics are widely used to solve this problem due to its NP-completeness. Although these ...
