IDEAS home Printed from https://ideas.repec.org/a/ids/ijisen/v34y2020i3p301-320.html
   My bibliography  Save this article

Simulated annealing approach to minimise total weighted tardiness of non-identical parallel batch processing machines

Author

Listed:
  • Rajani Kakkunuri
  • Christine Nguyen
  • Purushothaman Damodaran

Abstract

A variety of industries use batch processing machines (BPMs) that can process multiple jobs simultaneously per machine. This research considers the scheduling of multiple jobs onto non-identical parallel BPMs while minimising the total weighted tardiness. The problem under study is NP-hard and solving it to optimality using a commercial solver requires long run times when the size of the problem increases. A simulated annealing (SA) approach is proposed to find good solutions for large problem instances within short run times. The results obtained are compared to two metaheuristics, particle swarm optimisation (PSO) and differential evolution (DE), proposed in the literature and a commercial solver (CPLEX). An experimental study is conducted to evaluate the different solution approaches on a set of problem instances. Based on results, the authors conclude that SA is highly effective in solving large problem instances within reasonable run times when compared to CPLEX, PSO and DE.

Suggested Citation

  • Rajani Kakkunuri & Christine Nguyen & Purushothaman Damodaran, 2020. "Simulated annealing approach to minimise total weighted tardiness of non-identical parallel batch processing machines," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 34(3), pages 301-320.
  • Handle: RePEc:ids:ijisen:v:34:y:2020:i:3:p:301-320
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=105732
    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:ijisen:v:34:y:2020:i:3:p:301-320. 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=188 .

    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.