Optimisation of a machine loading problem using a genetic algorithm-based heuristic Online publication date: Sat, 18-Apr-2015
by Shrey Ginoria; G.L. Samuel; G. Srinivasan
International Journal of Productivity and Quality Management (IJPQM), Vol. 15, No. 1, 2015
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Productivity and Quality Management (IJPQM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook