A genetic algorithm and queuing theory based methodology for facilities layout problem

摘要

Facilities layout, being a significant contributor to manufacturing performance, has been studied many times over the past few decades. Existing studies are mainly based on material handling cost and have neglected several critical variations inherent in a manufacturing system. The static nature of available models has reduced the quality of the estimates of performance and led to not achieving an optimal layout. Using a queuing network model, an established tool to quantify the variations of a system and operational performance factors including work-in-process (WIP) and utilisation, can significantly help decision makers in solving a facilities layout problem. The queuing model utilised in this paper is our extension to the existing models through incorporating concurrently several operational features: availability of raw material, alternate routing of parts, effectiveness of a maintenance facility, quality of products, availability of processing tools and material handling equipment. On the other hand, a queuing model is not an optimisation tool in itself. A genetic algorithm, an effective search process for exploring a large search space, has been selected and implemented to solve the layout problem modelled with queuing theory. This combination provides a unique opportunity to consider the stochastic variations while achieving a good layout. A layout problem with unequal area facilities is considered in this paper. A good layout solution is the one which minimises the following four parameters: WIP cost, material handling cost, deviation cost, and relocation cost. Observations from experimental analysis are also reported in this paper. Our proposed methodology demonstrates that it has a potential to integrate several related decision-making problems in a unified framework.