Solving the Dynamic Facility Layout Problem with graph pair-based heuristics

• Main Authors: Hsiang-fan Hsieh, 謝祥凡
• Other Authors: Chi-tai Wang
• Format: Others
• Language: zh-TW
• Published: 2010
• Online Access: http://ndltd.ncl.edu.tw/handle/48712133894912505639

碩士 === 國立中央大學 === 工業管理研究所 === 98 === Recently, competitions among companies have been increased by advanced technology. Therefore, the facility layout of corporation will play an important role in the future and it will have influence on operational efficiency. In the past, traditional facilities planning always focused on the single-period. Because it did not consider the long-term layout planning for the future, it should pay extra cost and time when it need to re-layout. Basically, manufacturing organizations often adjust and vary layout periodically for the business strategy. For example, expanding, shrinking and moving the departments. Dynamic strategy is adjusting design of moving materials, varying space of departments via planning periods, to design and arrange the most efficient facility layout. But it will produce some relocation costs since change the layout from certain period to the next. However, we proposed a heuristic algorithm to minimize both material handling costs and relocation costs. Assuming all the departments are rectangular in shape, varying departments in area, given facility in area and planning period. We operate graph-pair to control the location of departments in layout. Solving the dynamic facility layout by a mixed-integer programming and dynamic heuristic algorithm.