 A simulated annealing approach to minimise makespan in a hybrid flowshop with a batch processing machineSantha Raja Kumari Upadhyayula, Shanthi Muthuswamy and Purushothaman Damodaran International Journal of Industrial and Systems Engineering, 2022, vol. 40, issue 4, 513-532 Abstract: A two-stage hybrid flowshop with a batch processing machine (BPM) in stage 1 and a set of discrete processing machines in stage 2 is considered in this research. Job sizes and their processing times are given. The BPM can process multiple jobs simultaneously as long as the total size of all jobs does not exceed its capacity, and the processing time is dictated by the longest processing job in the batch. In stage 2, the jobs have to be processed one at a time. The objective is to minimise the makespan. As the problem under study is NP-hard, a simulated annealing (SA) algorithm was designed. A mathematical formulation was also developed and a commercial solver was used to solve the problem instances. An experimental study was conducted to compare SA with the solver. The study highlights the efficiency of SA in solving larger problem instances with good quality solution in shorter computational time. Keywords: batch processing machines; BPMs; scheduling; hybrid flowshop; simulated annealing; makespan; heuristics. (search for similar items in EconPapers) Downloads: (external link) Related works: 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:513-532 Access Statistics for this article More articles in International Journal of Industrial and Systems Engineering from Inderscience Enterprises Ltd |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.