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

Rajani Kakkunuri, Christine Nguyen and Purushothaman Damodaran

International Journal of Industrial and Systems Engineering, 2020, vol. 34, issue 3, 301-320

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.

Keywords: scheduling; batch processing machines; BPM; weighted tardiness; simulated annealing; SA. (search for similar items in EconPapers)
Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=105732 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijisen:v:34:y:2020:i:3:p:301-320

Access Statistics for this article

More articles in International Journal of Industrial and Systems Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().