Loading...

An Algorithm for Solving Generalized Single Row Facility Layout Problem

Meskar, Mana | 2014

485 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 49588 (01)
  4. University: Sharif University of Technology
  5. Department: Industrial Engineering
  6. Advisor(s): Eshghi, Kourosh
  7. Abstract:
  8. Layout design problem is to determine a suitable arrangement for the departments, so that the total costs associated with the flow among departments become least. Single Row Facility Layout Problem which is called SRFLP, is one of layout problems that has many practical applications. This problem and its specific scenarios is often used to model many of the raised issues. This is arrangements of n departments with a specified length in a straight line, so that the sum of the weighted distances between pairs of departments is minimized. We can say that SRFLP is one-dimensional version of the layout design problem and it tries to minimize the cost of communication between rectangular departments with the same height. It is proven that this problem is NP-Complete. So it is not possible for today computers to give the optimal solution in a reasonable time for large-sized problems. That's why efforts to obtain near-optimal solutions or remodeling has taken place. Evaluation studies on SRFLP shows that the assumptions considered in SRFLP was the same in most cases. But in reality more assumptions should be considered. For example, placement of two departments next to each other can be unpleasant and can affect the value of the objective function. As well initial costs of departments may have relation to their locations. Therefore, reviewing and remodeling of SRFLP was done and then a new algorithm has been proposed to solve the new developed problem
  9. Keywords:
  10. Integer Programming ; Single Row Facility Layout Problem (SRFLP) ; Heuristic Algorithm

 Digital Object List

 Bookmark

No TOC