In this research, we have developed a new efficient heuristic algorithm for the dynamic facility layout problem with budget constraint (DFLPB). This heuristic algorithm combines two mathematical programming methods such as discrete event simulation and linear integer programming (IP) to obtain a near optimum solution. In the proposed algorithm, the non-linear model of the DFLP has been changed ...

a comprehensive and integrated study of any supply chain (sc) environment is a vital requirement that can create various advantages for the sc owners. this consideration causes productive managing of the sc through its whole wide components from upstream suppliers to downstream retailers and customers.  on this issue, despite many valuable studies reported in the current literature, considerabl...

A dynamic facility layout problem (DFLP) is concerned with finding a set of facility layouts across multiple time periods that minimizes the total cost of material flows and rearrangement costs. Unlike other heuristic approaches that focus mainly on the searching aspect, this research takes another approach by streamlining the data structure of solution representation to improve the solution sw...

The MAXIMUM PLANAR SUBGRAPH problem|given a graph G, nd a largest planar subgraph of G|has applications in circuit layout, facility layout, and graph drawing. No previous polynomial-time approximation algorithm for this NP-Complete problem was known to achieve a performance ratio larger than 1=3, which is achieved simply by producing a spanning tree of G. We present the rst approximation algori...

We provide the rst nontrivial approximation algorithm for MAXIMUM WEIGHT PLANAR SUBGRAPH, the NP-Hard problem of nding a heaviest planar subgraph in an edge-weighted graph G. This problem has applications in circuit layout, facility layout, and graph drawing. No previous algorithm for MAXIMUM WEIGHT PLANAR SUBGRAPH had performance ratio exceeding 1=3, which is obtained by any algorithm that pro...

Despite the reported effectiveness of analytical algorithms in facility layout planning, a detailed literature survey suggests a lack of new analytical methods in recent years. This paper focuses on open space facilities layout planning that involves modules with constant aspect ratios. We propose a construction-cum-improvement algorithm involving a novel combination of a boundary search-based ...

In this paper, we consider the problem of optimal placement of a single finite-size, rectangular facility in presence of other rectangular facilities. There is a non-negative interaction between the new and existing facilities as well as pairs of existing facilities. All interactions are serviced through a finite number of input/output points located on the boundary of each facility. We assume ...