Browsing Department of Industrial Engineering by Title
Now showing items 6281 of 663

Bicriteria robotic cell scheduling with controllable processing times
(Taylor & Francis, 2011)The current study deals with a bicriteria scheduling problem arising in an mmachine robotic cell consisting of CNC machines producing identical parts. Such machines by nature possess the process flexibility of altering ... 
Bicriteria robotic operation allocation in a flexible manufacturing cell
(Elsevier, 2010)Consider a manufacturing cell of two identical CNC machines and a material handling robot. Identical parts requesting the completion of a number of operations are to be produced in a cyclic scheduling environment through ... 
Bilateral trade with riskaverse intermediary using linear network optimization
(Wiley Periodicals, Inc., 2019)We consider bilateral trade of an object between a seller and a buyer through an intermediary who aims to maximize his/her expected gains as in the previous study, in a Bayes‐Nash equilibrium framework where the seller and ... 
A bilevel uncapacitated location/pricing problem with Hotelling access costs in onedimensional space
(International Conference on Information Systems, Logistics and Supply Chain, 2016)We formulate a spatial pricing problem as bilevel noncapacitated location: a leader first decides which facilities to open and sets service prices taking competing offers into account; then, customers make individual ... 
Bivariate density estimation with randomly truncated data
(Elsevier, 2000)In this study bivariate kernel density estimators are considered when a component is subject to random truncation. In bivariate truncation models one observes the i.i.d. samples from the triplets (T, Y, X) only if T less ... 
Bivariate distribution and the hazard functions when a component is randomly truncated
(Elsevier, 199701)In random truncation models one observes the i.i.d. pairs (Ti≤Yi), i=1, ..., n. If Y is the variable of interest, then T is another independent variable which prevents the complete observation of Y and random left truncation ... 
Bivariate estimation with righttruncated data
(Taylor & Francis, 1996)Bivariate estimation with survival data has received considerable attention recently; however, most of the work has focused on random censoring models. Another common feature of survival data, random truncation, is considered ... 
Bi‐objective optimization of a grid‐connected decentralized energy system
(John Wiley and Sons, 2018)Motivated by the increasing transition from fossil fuelbased centralized systems to renewable energybased decentralized systems, we consider a biobjective investment planning problem of a gridconnected decentralized ... 
Boolean normal forms, shellability, and reliability computations
(Society for Industrial and Applied Mathematics, 2000)Orthogonal forms of positive Boolean functions play an important role in reliability theory, since the probability that they take value 1 can be easily computed. However, few classes of disjunctive normal forms are known ... 
Bound constrained quadratic programming via piecewise quadratic functions
(SpringerVerlag, 1999)We consider the strictly convex quadratic programming problem with bounded variables. A dual problem is derived using Lagrange duality. The dual problem is the minimization of an unconstrained, piecewise quadratic function. ... 
Bounds on riskaverse mixedinteger multistage stochastic programming problems with meanCVaR
(Elsevier B.V., 2018)Riskaverse mixedinteger multistage stochastic programming forms a class of extremely challenging problems since the problem size grows exponentially with the number of stages, the problem is nonconvex due to integrality ... 
Bounds on the opportunity cost of neglecting reoptimization in mathematical programming
(INFORMS, 2000)Postoptimality or sensitivity analysis are welldeveloped subjects in almost all branches of mathematical programming. In this note, we propose a simple formula which can be used to get preliminary bounds on the value of ... 
A branch and cut algorithm for hub location problems with single assignment
(Springer, 2005)The hub location problem with single assignment is the problem of locating hubs and assigning the terminal nodes to hubs in order to minimize the cost of hub installation and the cost of routing the traffic in the network. ... 
A branch and price approach for routing and refueling station location model
(Elsevier, 2016)The deviation flow refueling location problem is to locate p refueling stations in order to maximize the flow volume that can be refueled respecting the range limitations of the alternative fuel vehicles and the shortest ... 
A branchandcut algorithm for quadratic assignment problems based on linearizations
(Elsevier, 200704)The quadratic assignment problem (QAP) is one of the hardest combinatorial optimization problems known. Exact solution attempts proposed for instances of size larger than 15 have been generally unsuccessful even though ... 
A branchandcut algorithm for the alternative fuel refueling station location problem with routing
(INFORMS, 2019)Because of the limited range of alternative fuel vehicles (AFVs) and the sparsity of the available alternative refueling stations (AFSs), AFV drivers cooperatively deviate from their paths to refuel. This deviation is ... 
A branchandcut algorithm for the hub location and routing problem
(Elsevier, 2014)We study the hub location and routing problem where we decide on the location of hubs, the allocation of nodes to hubs, and the routing among the nodes allocated to the same hubs, with the aim of minimizing the total ... 
A branchandcut algorithm for twolevel survivable network design problems
(Elsevier, 2016)This paper approaches the problem of designing a twolevel network protected against singleedge failures. The problem simultaneously decides on the partition of the set of nodes into terminals and hubs, the connection of ... 
A branchandprice algorithm for the vehicle routing problem with roaming delivery locations
(Elsevier Ltd, 2017)We study the vehicle routing problem with roaming delivery locations in which the goal is to find a leastcost set of delivery routes for a fleet of capacitated vehicles and in which a customer order has to be delivered ... 
Branchandprice approaches for the network design problem with relays
(Elsevier, 2018)With different names and characteristics, relays play a crucial role in the design of transportation and telecommunication networks. In transportation networks, relays are strategic locations where exchange of drivers, ...