IDEAS home Printed from https://ideas.repec.org/a/ids/ijpqma/v15y2015i1p36-56.html
   My bibliography  Save this article

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

Author

Listed:
  • Shrey Ginoria
  • G.L. Samuel
  • G. Srinivasan

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.

Suggested Citation

  • Shrey Ginoria & G.L. Samuel & G. Srinivasan, 2015. "Optimisation of a machine loading problem using a genetic algorithm-based heuristic," International Journal of Productivity and Quality Management, Inderscience Enterprises Ltd, vol. 15(1), pages 36-56.
    • Handle: RePEc:ids:ijpqma:v:15:y:2015:i:1:p:36-56
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=65984
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijpqma:v:15:y:2015:i:1:p:36-56. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=177 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.