There are two obvious ways to map a two-dimension relational database table onto a one-dimensional storage interface: store the table row-by-row, or store the table column-by-column. Historically, database system implementations and research have focused on the row-by row data layout, since it performs best on the most common application for database systems: business transactional data process...

The single-row layout problem (SRLP) is concerned with the arrangement of a given number of rectangular facilities next to each other along a line so as to minimize the total weighted sum of the center-to-center distances between all pairs of facilities. This problem is a special case of the unequalarea facility layout problem, and is also known in the literature as the onedimensional space all...

this paper offers an approach that could be useful for diverse types of layout problems or even area allocation problems. by this approach there is no need to large number of discrete variables and only by few continues variables large-scale layout problems could be solved in polynomial time. this is resulted from dividing area into discrete and continuous dimensions. also defining decision var...

s of the Presentations Solving inconsistencys preserving the zero-structure Paula Amaral, Joaquim Júdice and Hanif Sherali, University of Coimbra In this talk we describe an nonlinear optimization model for correcting an inconsistent linear system. By correction we mean a perturbation of both the matrix of coefficients and right-hand-side of the linear system of inequalities. Inconsistency of a...

facility layout problems (FLPs) are common problem in several manufacturing industries because FLPs have a great impact on production operations. Efficient manufacturing facility layout design could lead to lower manufacturing costs. Therefore, many sub problems should be addressed and considered from design stage. This research proposes a new framework for mix-model assembly line (MAL) manufac...

This paper presents a history of a difficult facility layout problem that falls into the category of the Koopmans-Beckmann variant of the Quadratic Assignment Problem (QAP), wherein 30 facilities are to be assigned to 30 locations. The problem arose in 1972 as part of the design of a German university hospital, Klinikum Regensburg. This problem, known as the Krarup30a upon its inclusion in the ...

Single row machine layout problem is one of the most commonly used layout patterns, especially in &exible manufacturing systems. In this paper, this problem is formulated as a non-linear 0-1 programming model in which the distance between the machines is sequence dependent. An ant algorithm has been developed to solve this problem. A technique is proposed to e2ciently implement the proposed alg...

In this study, solutions for machinery layout with the aim of reducing transportation costs will be discussed. To do this, imperialist competitive algorithm (ICA), which is a very complicated and effective meta-heuristic algorithm is introduced. In the offered algorithm, different kinds of machinery layout are considered in single-row as country and then the best possible layout is developed ba...