Title: Optimisation of a machine loading problem using a genetic algorithm-based heuristic

Authors: Shrey Ginoria; G.L. Samuel; G. Srinivasan

Addresses: Manufacturing Engineering Section, Department of Mechanical Engineering, Indian Institute of Technology Madras, Chennai – 600 036, India ' Manufacturing Engineering Section, Department of Mechanical Engineering, Indian Institute of Technology Madras, Chennai – 600 036, India ' Department of Management Studies, Indian Institute of Technology Madras, Chennai – 600 036, India

Abstract: In the present work, apart from operating on the structure of a conventional genetic algorithm (GA), a heuristic which uses techniques like differential mutation probability, elitism and local search is used to produce near optimal solutions for large machine loading problems with less computational intensity. Two variants of the machine loading problem are analysed in the present work: single batch model and the multiple batch models. The sensitivity of the problem with respect to the tool capacity constraint is evaluated to find that moderately restricted problems requiring greater computational resources in comparison to lesser restricted and tightly restricted class of problems. The performance of various dispatching rules was compared to infer that the least slack principle fares better than the other tested dispatching rules. It is observed from the results, that the proposed heuristic is efficient in handling large and complex machine loading problems.

Keywords: flexible manufacturing systems; FMS; machine loading; load balancing; tool savings; genetic algorithms; branch and bound; optimisation; machine loading; tool capacity.

DOI: 10.1504/IJPQM.2015.065984

International Journal of Productivity and Quality Management, 2015 Vol.15 No.1, pp.36 - 56

Received: 08 May 2021
Accepted: 12 May 2021

Published online: 06 Nov 2014 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article