An Enhanced Tabu Search Cell Formation Algorithm for a Cellular Manufacturing System

An Enhanced Tabu Search Cell Formation Algorithm for a Cellular Manufacturing System

Vikrant Sharma, B. D. Gidwani
Copyright: © 2022 |Pages: 18
DOI: 10.4018/IJAMC.292498
Article PDF Download
Open access articles are freely available for download

Abstract

The major benefit of using Cellular manufacturing systems (CMS) is the improvement in efficiency and reduction in the production time. In a CMS the part families and machine parts are identified to minimise the inter and intracellular movement and maximise the utilisation of machines within each cell. Many scholars have proposed methods for the evaluation of machine cell part layouts with single routes; this paper introduces a modified Hybrid Tabu Search Algorithm (HTSA) referred to as Hybrid Algorithm in this study for machine cell part layouts having multiple routes as well. The primary objective of this paper is to minimise the inter and intracellular movement using a hybrid algorithm. The paper presents a comparative analysis of the existing and the proposed algorithms, proving that the proposed hybrid algorithm is simple, easy to understand, and has a remarkable efficiency with a runtime of 5.6 seconds.
Article Preview
Top

1. Introduction

The Cellular Manufacturing System (CMS) is an innovative manufacturing strategy derived from the group technology (GT) concept. It identifies machinery cells, parts families, and uses these machines to the greatest extent possible to minimise intercellular movement (Chang et al., 2013, Houshyar et al., 2014). A number of companies have favoured CMS with reduced transport time for various parts, cycle time and installation times. It also improved the expertise of operators and human relationships (Gunasekaran, 1994). Cell development, cell layout and intracellular sequencing are key aspects of CMS design (Wu, Low, & Wu, 2004, Imran et al., 2017).

The problem of cell formation (CF) is the division of GT. Grouping of machines and machine parts in a cellular manufacturing process with similar processing methods in all sets of machines is known as the cell formation problem. In certain cases, cell configurations are designed with diversified planning periods for different types of applications. Based on the cell formation process, a fundamental relation will be established among machines and parts. Machine parts would then be assembled to process all parts of the machine family with similar arrangement. There are certain goals to determine the feasibility of the cellular manufacturing system, such as minimising inter- or intra-cell movements, increasing machine utilisation and reducing expenses by reducing setup times. CMS design includes numerous interconnection issues, machine grouping, parts family formation, and cell design. Under assembly conditions, GT was used to make manufacturing frameworks more profitable.

Group of GT possesses certain prominent features which needs to be assembled into the part families and an efficient CMS is used for this purpose. CMS offers various advantages such as reduced workloads, decreased computation time, more restrictive lead-time assembly, lower inventory, and increased robustness to withstand internal and external changes such as machine deceptions.

This research presents an enhanced, incredible method of metaheuristic cell development. The problem of cell arrangement is to assemble machines and part of families into cells with an aim of limiting intercellular developments. There is a possibility of considering the decrease of cell load variety and another possibility that consolidates a minimum of cell load variation and intercellular developments. This is addressed by improving the cell system using the metaheuristic. The source can determine the required number of cells of previous and lower and upper cell size limits. This allows the prohibited investigation to adapt to cell development problems. The system of arrangements worked well for large-scale problems tried out and information indexes distributed. The aftereffects of computational tests introduced are extremely reassuring. Various non-customary survey algorithms are available for CMS approach. The aim is to recognise the families of parts and the assembly of machines and to shape the production cells in order to limit the quantity of remarkable components. Although cell assembly offers incredible benefits, the CMS plan is unpredictable for real issues. It is noted that the cell development problem in CMS is one of the NP-hard combination problems. Numerous models and arrangements were developed to distinguish machine cells and part families as it is difficult to achieve ideal arrangements in a satisfactory measure of time, especially in the case of huge, estimated problems. These methodologies can be divided into three main classes: models for mathematical programming (MP), algorithms for heuristic / meta-heuristic arrangement and similarity coefficient methods (SCM). Although the CF has been the focal point of the investigations for a number of years, there are a few variations of the CF merits equivalent considerations on them, such as the CF allowing alternative process. A large portion of the above CF explores the expectation that each part will have an exceptional cycle direction. However, it is noteworthy that there may be options in any degree of a cycle plan. Essentially, only a limited measure of examination with respect to the CF managed machine breakdowns or unwavering quality issues. Customarily, CF and work distribution are carried out, accepting that all machines are 100% reliable. However, this is not generally the case. Their breakdowns could have a significant impact on the framework execution gauges and could have adverse impacts on the performance due date. In order to improve the overall presentation of the framework, machine failure should now be considered during the CMS plan.

Complete Article List

Search this Journal:
Reset
Volume 15: 1 Issue (2024)
Volume 14: 1 Issue (2023)
Volume 13: 4 Issues (2022): 2 Released, 2 Forthcoming
Volume 12: 4 Issues (2021)
Volume 11: 4 Issues (2020)
Volume 10: 4 Issues (2019)
Volume 9: 4 Issues (2018)
Volume 8: 4 Issues (2017)
Volume 7: 4 Issues (2016)
Volume 6: 4 Issues (2015)
Volume 5: 4 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing