Minimising makespan of a batch processing machine with unequal job ready times using simulated annealing

Leena Ghrayeb and Purushothaman Damodaran

International Journal of Industrial and Systems Engineering, 2023, vol. 43, issue 2, 222-237

Abstract: Batch processing machines can process multiple jobs simultaneously. Given a set of jobs with their processing times, ready times, and sizes, the objective is to minimise the makespan. Two interdependent decisions are required: group jobs to form batches and schedule batches on the machine. The processing and ready times of the batch depends on the composition of the batch. Batch ready time is equal to the largest ready time of all the jobs in a batch. Similarly, batch processing time is equal to the largest processing time of all the jobs in a batch. As the problem under study is NP-hard, a simulated annealing (SA) approach is proposed. The proposed approach is evaluated by comparing its solution quality and run time with a commercial solver used to solve a mathematical formulation. An experimental study shows that the SA approach is fast in finding good solutions as the problem size increases.

Keywords: scheduling; batch processing machine; BPM; makespan; simulated annealing. (search for similar items in EconPapers)
Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=128670 (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:43:y:2023:i:2:p:222-237

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 ().