Minimising makespan of batch processing machine with unequal ready times Online publication date: Fri, 13-May-2022
by Leena Ghrayeb; Shanthi Muthuswamy; Purushothaman Damodaran
International Journal of Industrial and Systems Engineering (IJISE), Vol. 40, No. 4, 2022
Abstract: This research considers scheduling a single batch processing machine at a contract electronics manufacturer. The processing times, ready times and the sizes of the jobs are given and the total size of the batch should not exceed the machine capacity. The batch ready time is equal to the latest ready time of all the jobs in the batch. The objective is to minimise the makespan. The commercial solver used to solve the mathematical formulation proposed requires long run times. Consequently, several heuristics and lower bounding procedures are proposed. Through an experimental study, it is shown that one of the lower bounds is within 40% of the best known integer solution from CPLEX for the 200-job instances. The heuristics are very effective in finding good quality solutions with short run times. For smaller problem instances, the quality of the heuristic solution is within 10% of the best known solution from CPLEX.
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