Minimising makespan of a batch processing machine with unequal job ready times using simulated annealing Online publication date: Wed, 01-Feb-2023
by Leena Ghrayeb; Purushothaman Damodaran
International Journal of Industrial and Systems Engineering (IJISE), Vol. 43, No. 2, 2023
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.
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 Industrial and Systems Engineering (IJISE):
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