Loughborough University
Leicestershire, UK
LE11 3TU
+44 (0)1509 263171
Loughborough University

Loughborough University Institutional Repository

Please use this identifier to cite or link to this item: https://dspace.lboro.ac.uk/2134/4676

Title: Part selection and operation-machine assignment in FMS environment: A genetic algorithm with chromosome differentiation based methodology
Authors: Choudhary, Alok K.
Tiwari, Manoj K.
Harding, Jennifer A.
Keywords: Flexible manufacturing system
Machine loading
Genetic algorithm
Chromosome differentiation
Issue Date: 2006
Publisher: Professional Engineering Publishing / © IMechE
Citation: CHOUDHARY, A.K., TIWARI, M.K. and HARDING, J.A., 2006. Part selection and operation-machine assignment in FMS environment: A genetic algorithm with chromosome differentiation based methodology. Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, 220 (5), pp. 677-694
Abstract: Production planning of a flexible manufacturing system (FMS) is plagued by two interrelated problems, i.e. part type selection and operation allocation on machines. The combination of these problems is termed the machine-loading problem, which is a well-known complex puzzle and treated as a strongly NP-hard problem. In this research, a machine-loading problem has been modelled, taking into consideration several technological constraints related to the flexibility of machines, availability of machining time, tool slots, etc., while aiming to satisfy the objectives of minimizing the system unbalance, maximizing throughput, and achieving very good overall FMS utilization. The solution of such problems, even for moderate numbers of part types and machines, is marked by excessive computation complexities and therefore advanced random search and optimization techniques are needed to resolve them. In this paper, a new kind of genetic algorithm, termed a genetic algorithm with chromosome differentiation, has been used to address a well-known machine-loading problem. The proposed algorithm overcomes the drawbacks of the simple genetic algorithm and the methodology reported here is capable of achieving a better balance between exploration and exploitation and of escaping from local minima. The proposed algorithm has been tested on ten standard test problems adopted from literature and extensive computational experiments have revealed its superiority over earlier approaches.
Description: This is an article from the journal, Proceedings of the IMechE, Part B: Journal of Engineering Manufacture [© IMechE]. It is also available at: http://journals.pepublishing.com/content/119784/?p=710e956435344e5bb554ce59223c763c&pi=0
Version: Published
DOI: 10.1243/09544054JEM207
URI: https://dspace.lboro.ac.uk/2134/4676
ISSN: 0954-4054
Appears in Collections:Published Articles (Mechanical, Electrical and Manufacturing Engineering)

Files associated with this item:

File Description SizeFormat
part selection.pdf421.03 kBAdobe PDFView/Open


SFX Query

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.