Minimising makespan of batch processing machine with unequal ready times

Leena Ghrayeb, Shanthi Muthuswamy and Purushothaman Damodaran

International Journal of Industrial and Systems Engineering, 2022, vol. 40, issue 4, 496-512

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.

Keywords: batch processing machine; BPM; scheduling; makespan; heuristics; lower bound. (search for similar items in EconPapers)
Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=122823 (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:40:y:2022:i:4:p:496-512

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