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...

Optimisation of facility layout design problem with safety and environmental factors by stochastic DEA and simulation approach A. Azadeh, T. Nazari & H. Charkhand a School of Industrial and Systems Engineering and Center of Excellence for Intelligent Based Experimental Mechanics, University College of Engineering, University of Tehran, Tehran, Iran b HSE Department, National Petrochemical Compa...

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...

Genetic Algorithm which is based on the Darwinian principle of natural selection has been successfully applied to Berth allocation problem (BAP), which can decide the ships’ berthing position and berthing time at a container terminal. Considering the service priority, handing time deciding variables, safety clearance, as well as the berths’ physical conditions, a dynamic berth allocation with d...

The main characteristic of today’s manufacturing environments is volatility. Under such a volatile environment some parameters like demand is not stable. To operate efficiently under such environments, the facilities must be adaptive to change production requirements. From a layout point of view, this situation requires the solution of the dynamic layout problem (DLP). Layout design has a signi...