This paper supersedes the work presented in WP.No.2014-02-06. We study the problem of allocating doctors to primary health centers (PHC). We model the problem as a multi-period uncapacitated facility location problem under uncertainty. The problem is unconventional in that the uncertainty is in...

The corridor allocation problem is one of assigning a given set of facilities in two rows along a straight corridor so as to minimize a weighted sum of the distances between every pair of facilities. This problem has practical applications in arrangements of rooms in oces and in hospitals. The...

Blowouts are nancially damaging for drilling companies and are ecological hazards. Hence blowout prevention equipment is critical infrastructure for drilling companies. Blowout preventer valves are important components of blowout prevention equipments and need to be checked regularly. However,...

Since material handling agents in a FMS are most efficient when moving in straight lines, a common layout of machines in a FMS is a single row layout. This allows a floor designer to model the problem of generating an optimal machine layout in a FMS as a single row facility layout problem...

The single row facility layout is the NP-Hard problem of arranging facilities with given lengths on a line, so as to minimize the weighted sum of the distances between all pairs of facilities. Owing to the computational complexity of the problem, researchers have developed several heuristics to...

In this work we present a local search algorithm for the single row facility location problem. In contrast to other local search algorithms for the problem, our algorithm uses an exponential neighborhood structure. Our computations indicate that our local search algorithm generates solutions to...

The single row facility layout problem (SRFLP) is the problem of arranging facilities with given lengths on a line, with the objective of minimizing the weighted sum of the distances between all pairs of facilities. The problem is NP-hard and research has focused on heuristics to solve large...

The single row facility layout problem (SRFLP) is an important combinatorial optimization problem where a given set of facilities have to be arranged in a single row so as to minimize the weighted sum of the distances between all pairs of facilities. Sensitivity analysis for the SRFLP has not...

The single row facility layout problem is the problem of arranging facilities with given lengths on a line, while minimizing the weighted sum of the distances between all pairs of facilities. The problem is NP-hard. In this paper we present path relinking algorithms to solve large sized...

The single row facility layout problem (SRFLP) is a NP-hard problem concerned with the arrangement of facilities of given lenghs on a line so as to minimize the weighted sum of the distances between all the pairs of facilities. The SRFLP and its special cases often arise while modeling a large...