Abstract The purpose of this study is to consider an international facility location problem under uncertainty and present an integrated model for strategic and operational planning. The paper offers two methodologies for the location selection decision. First the extended VIKOR method for decision making problem with interval numbers is presented as a methodology for strategic evaluation of po...

The location-routing problem is the most significant and yet new research field in location problems that considers simultaneously vehicle routing problem features with original one for achieving high-quality integrated distribution systems in beside of the global optimum. Simultaneous pickup and delivery based on time windows are the two main characteristics of logistic management that have be...

We study the problem of leasing facilities over time, following the general infrastructure leasing problem framework introduced by Anthony and Gupta [1]. If there are K different lease types, Anthony and Gupta give an O(K)-approximation algorithm for the problem. We are able to improve this to a 3-approximation algorithm by using a variant of the primal-dual facility location algorithm of Jain ...

The hub location problem arises in a variety of domains such as transportation and telecommunication systems. In many real-world situations, hub facilities are subject to disruption. This paper deals with the multiple allocation hub location problem in the presence of facilities failure. To model the problem, a two-stage stochastic formulation is developed. In the proposed model, the number of ...

in today's globalization, an effective integration of production and distribution plans into a unified framework is crucial for attaining competitive advantage. this paper addresses an integrated multi-product and multi-time period production/distribution planning problem for a two-echelon supply chain subject to the real-world variables and constraints. it is assumed that all transportations a...

We consider a competitive facility location problem on a network in which consumers located on vertices wish to connect to the nearest facility. Knowing this, each competitor locates a facility on a vertex, trying to maximize her market share. We focus on the two-player case and study conditions that guarantee the existence of a pure-strategy Nash equilibrium in this finite non-cooperative game...

We describe a decomposition algorithm that combines Benders and scenariobased Lagrangean decomposition for two-stage stochastic programming investment planning problems with complete recourse, where the first-stage variables are mixedinteger and the second-stage variables are continuous. The algorithm is based on the cross-decomposition scheme and fully integrates primal and dual information in...

the aim of this paper is to study a multi-product, multi-period production systems in a hybrid flow shop so that lot-sizing and scheduling will be detemined simultaneously. a new mixed-integer programming model is proposed to formulate the studied problem. the objective function in this investigation includes the total cost of production, inventory and external supply. in the case of not satisf...