In this paper we study a simple vulnerability-based stochastic dependency model of link failures in a network prone to disasters. Under this model, we study the problem of locating k facilities to maximize the expected demand serviced within a given distance, and show its equivalence to the well-studied maximum k-facility location problem. In the special case when there is no distance constrain...

Purpose – In spite of having a number of general-purpose algorithms for solving plant layout problems, facility planners may still face a challenging task to adjust these algorithms to handle special, but not uncommon, layout problems. The purpose of this study is to propose a new method for addressing the impact of overhead space utilization on a plant layout solution. Design/methodology/appro...

this paper addresses a reliable facility location problem with considering facility capacity constraints. in reliable facility location problem some facilities may become unavailable from time to time. if a facility fails, its clients should refer to other facilities by paying the cost of retransfer to these facilities. hence, the fail of facilities leads to disruptions in facility location dec...

INTRODUCTION: The appropriate-use optimization of the limited spaces of the Iranian hospitals is believed to be a crucial step towards promoting the efficiency of these healthcare centers. The issue determining the optimization patterns of the layout of units has led to a lot of efforts by researchers as it increases the efficiency of the hospitals through patients’ improvement, changing the lo...

This paper proposes a bi-objective model for the facility location problem under a congestion system. The idea of the model is motivated by applications of locating servers in bank automated teller machines (ATMS), communication networks, and so on. This model can be specifically considered for situations in which fixed service facilities are congested by stochastic demand within queueing frame...

We de ̄ne a new model for adjacency subgraph selection for the facility layout problem based on proximity and present some heuristics for its solution. The new model presents a more realistic representation of the problem than previous ones in that departments which are nonadjacent yet \close" to each other are compensated in the determination of the optimal adjacency subgraph. Empirical results...

This article provides a case study for a fire extinguisher manufacturing company in North America that has been building a new facility in Mexico to benefit from North America Free Trade Agreement (NAFTA) and low production cost. The company utilized a value stream mapping to finalize its new facility’s manufacturing process design, and divided the process into several groups, some of which wer...

In this paper, a method called an enhanced local search (ELS) is described. ELS is a general framework endowed with a number of local search algorithms intended for providing a better performance for a wide range of problem instances. Thus, ELS is expected to perform well regardless of the particular instances of the problem to be solved. Computational tests show that ELS can be very efficient ...

We present branch-and-bound algorithms for nding a maximum planar subgraph of a nonplanar graph. The problem has important applications in circuit layout, automated graph drawing, and facility layout. The algorithms described utilize heuristics to obtain an initial lower bound for the size of a maximum planar subgraph, then apply a sequence of fast preliminary tests for planarity to eliminate i...