A simple heuristic for linear sequencing of machines in layout design

Abstract

This paper presents a simple heuristic to determine a common linear machine sequence for multiple products with different operation sequences and a limited number of duplicate machine types available for the job. The heuristic is based on minimization of the total flow distance traveled by a product on the linear machine sequence. It is assumed that the flows of products are allowed only in the forward direction, either in-sequence or bypass. It is also assumed that backtrack movements are not allowed. The effectiveness of the proposed heuristic is demonstrated through the solutions of two typical layout design problems taken from the literature. Subsequently, a number of additional problems are solved and their results are compared with the results applying existing methods. The results indicate that the proposed method can be an effective tool in solving layout design problems.

A Tabu Search for Multi-Objective Single Row Facility Layout Problem

“…A good number of randomly generated problems and as well as problems discussed in Pillai et al (2005), Chen et al (2001), and Siva Kumar et al (2011) have also been solved using the proposed methodology. Input data, such as the number of products and their machine type sequences and product demand, are listed in Appendix Table A1.…”

The Performance Analysis of Functional and Reconfigured Layout by Minimising Intercellular Movement: A Case Study of Indian Sme

“…The results shown the performance of flow line, job shop and cellular layout is changed due to layout design. Kumar et al 12 have suggested heuristic method for the issues associated to layout design. The method considers unidirectional flow of material, avoiding back-tracking and emphasizing the distance traveled by the components to be minimum.…”

A Closed-Form Approach for Optimum Tolerance Allocation of Assemblies with General Tolerance-Cost Function

“…Moreover, the near-optimal solutions obtained using nontraditional optimization techniques were not consistent, such that there was also the probability of skipping the best manufacturing process for optimum tolerance allocation of complex assemblies with alternative processes selection. As a consequent, Kumar et al [10] and Kumar & Stalin [11] collocate LM method with certain search technique to discover the optimum tolerance allocation of complex assemblies with alternative processes selection, the methodologies can reveal better results than nontraditional optimization approach. While it is known that LM method is an efficient approach to accomplish optimal tolerance allocation, this paper is an attempt to provide a systematic and comprehensive analysis for minimum-cost tolerance allocation based on LM method.…”