Browsing Department of Industrial Engineering by Title
Now showing items 612631 of 677

A stability concept for zeroone knapsack problems and approximation algorithms
(Taylor & Francis, 1995)The concept of reducing the feasible range of decision variables or fixing the value of the variables is extended for the knapsack problem to include sets of variables. The ease of fixing these variables is measured by a ... 
A Stackelberg game model for resource allocation in cargo container security
(Springer, 2011)This paper presents a game theoretic model that analyzes resource allocation strategies against an adaptive adversary to secure cargo container transportation. The defender allocates security resources that could interdict ... 
Star phub center problem and star phub median problem with bounded path lengths
(2012)We consider two problems that arise in designing twolevel star networks taking into account service quality considerations. Given a set of nodes with pairwise traffic demand and a central hub, we select p hubs and connect ... 
Star phub median problem with modular arc capacities
(Elsevier, 2008)We consider the hub location problem, where p hubs are chosen from a given set of nodes, each nonhub node is connected to exactly one hub and each hub is connected to a central hub. Links are installed on the arcs of the ... 
Statedependent control of a single stage hybrid system with poisson arrivals
(2011)We consider a singlestage hybrid manufacturing system where jobs arrive according to a Poisson process. These jobs undergo a deterministic process which is controllable. We define a stochastic hybrid optimal control problem ... 
Static and dynamic VaR constrained portfolios with application to delegated portfolio management
(2013)We give a closedform solution to the singleperiod portfolio selection problem with a ValueatRisk (VaR) constraint in the presence of a set of risky assets with multivariate normally distributed returns and the riskless ... 
Stochastic assembly line balancing using beam search
(Taylor & Francis, 2005)This paper presents a beam searchbased method for the stochastic assembly line balancing problem in Ulines. The proposed method minimizes total expected cost comprised of total labour cost and total expected incompletion ... 
The stochastic joint replenishment problem: a new policy, analysis, and insights
(John Wiley & Sons, 2006)In this study, we propose a new parsimonious policy for the stochastic joint replenishment problem in a singlelocation, Nitem setting. The replenishment decisions are based on both group reorder pointgroup order quantity ... 
Stochastic lot sizing problem with controllable processing times
(Elsevier, 2015)In this study, we consider the stochastic capacitated lot sizing problem with controllable processing times where processing times can be reduced in return for extra compression cost. We assume that the compression cost ... 
Stochastic lot sizing problem with nervousness considerations
(Elsevier, 2018)In this paper, we consider the multistage stochastic lot sizing problem with controllable processing times under nervousness considerations. We assume that the processing times can be reduced in return for extra cost ... 
A stochastic model for a macroscale hybrid renewable energy system
(Elsevier, 2016)The current supply for electricity generation mostly relies on fossil fuels, which are finite and pose a great threat to the environment. Therefore, energy models that involve clean and renewable energy sources are necessary ... 
A stochastic programming approach for Shelter location and evacuation planning
(EDP Sciences, 20180919)Shelter location and traffic allocation decisions are critical for an efficient evacuation plan. In this study, we propose a scenariobased twostage stochastic evacuation planning model that optimally locates shelter sites ... 
A strong conic quadratic reformulation for machinejob assignment with controllable processing times
(Elsevier, 2009)We describe a polynomialsize conic quadratic reformulation for a machinejob assignment problem with separable convex cost. Because the conic strengthening is based only on the objective of the problem, it can also be ... 
Structured least squares problems and robust estimators
(IEEE, 20101022)A novel approach is proposed to provide robust and accurate estimates for linear regression problems when both the measurement vector and the coefficient matrix are structured and subject to errors or uncertainty. A new ... 
Structured least squares with bounded data uncertainties
(IEEE, 2009)In many signal processing applications the core problem reduces to a linear system of equations. Coefficient matrix uncertainties create a significant challenge in obtaining reliable solutions. In this paper, we present a ... 
A study of scheduling rules of flexible manufacturing systems : a simulation approach
(Taylor & Francis, 1998)This study examines the effects of scheduling rules on the performance of flexible manufacturing systems (FMSs). Several machine and AGV scheduling rules are tested against the mean flowtime criterion. In general, scheduling ... 
A study on curing processes and environmental effects for rapid composite repair
(2011)This article focuses on scarf joint comprised of vacuumprecured, vacuumcocured, autoclaveprocured, and autoclavecocured composite patches bonded to autoclave and vacuumprecured parent laminates. Autoclave and ... 
Style goods pricing with demand learning
(Elsevier, 20090801)For many industries (e.g., apparel retailing) managing demand through price adjustments is often the only tool left to companies once the replenishment decisions are made. A significant amount of uncertainty about the ... 
A subgradient descent algorithm for optimization of initially controllable flow shop systems
(2009)We consider an optimization problem for deterministic flow shop systems processing identical jobs. The service times are initially controllable; they can only be set before processing the first job, and cannot be altered ... 
Sufficient global optimality conditions for bivalent quadratic optimization
(Springer, 2004)We prove a sufficient global optimality condition for the problem of minimizing a quadratic function subject to quadratic equality constraints where the variables are allowed to take values 1 and 1. We extend the condition ...