A simulated annealing approach to minimise makespan in a hybrid flowshop with a batch processing machine

被引：0
作者：
Upadhyayula S.R.K. [1 ]
Muthuswamy S. [2 ]
Damodaran P. [1 ]
机构：
[1] Department of Industrial and Systems Engineering, Northern Illinois University, De Kalb
[2] Department of Engineering Technology, Northern Illinois University, De Kalb
来源：
International Journal of Industrial and Systems Engineering | 2022年 / 40卷 / 04期
关键词：
Batch processing machines; BPMs; heuristics; hybrid flowshop; makespan; scheduling; simulated annealing;
D O I：
10.1504/IJISE.2022.122825
中图分类号：
学科分类号：
摘要：
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. © 2022 Inderscience Enterprises Ltd.
引用
收藏
页码：513 / 532
页数：19
相关论文
共 18 条
  • [1] Alaykyran K., Engin O., Doyen A., Using ant colony optimization to solve hybrid flow shop scheduling problems, International Journal of Advanced Manufacturing Technology, 35, 5, pp. 541-550, (2007)
  • [2] Damodaran P., Diyadawagamage D., Ghrayeb O., Velez-Gallego M., A particle swarm optimization algorithm for minimizing makespan of nonidentical parallel batch processing machines, International Journal of Advanced Manufacturing Technology, 58, 9-12, pp. 1131-1140, (2012)
  • [3] Gupta J., Stafford E., Flowshop scheduling research after five decades, European Journal of Operational Research, 169, 3, pp. 699-711, (2006)
  • [4] Jia Z., Zhang Y., Leung J.Y-T., Li K., Bi-criteria ant colony optimization algorithm for minimizing makespan and energy consumption on parallel batch machines, Applied Soft Computing, 55, pp. 226-237, (2017)
  • [5] Jolai F., Asefi H., Rabiee M., Ramezani P., Bi-objective simulated annealing approaches for no-wait two-stage flexible flow shop scheduling problem, Scientia Iranica, 20, 3, pp. 861-872, (2013)
  • [6] Li D., Meng X., Liang Q., Zhao J., A heuristic-search genetic algorithm for multi-stage hybrid flow shop scheduling with single processing machines and batch processing machines, Journal of Intelligent Manufacturing, 26, 5, pp. 873-890, (2015)
  • [7] Luo H., Huang G.Q., Zhang Y., Dai Q., Chen X., Two-stage hybrid batching flowshop scheduling with blocking and machine availability constraints using genetic algorithm, Robotics and Computer-Integrated Manufacturing, 25, 6, pp. 962-971, (2009)
  • [8] Marichelvam M.K., Prabaharan T., Yang X.S., Improved cuckoo search algorithm for hybrid flow shop scheduling problems to minimize makespan, Applied Soft Computing, 19, 6, pp. 93-101, (2014)
  • [9] Mousavi S.M., Zandieh M., Yazdani M., A simulated annealing/local search to minimize the makespan and total tardiness on a hybrid flowshop, International Journal of Advanced Manufacturing Technology, 64, 1-4, pp. 369-388, (2013)
  • [10] Muthuswamy S., Velez-Gallego M., Maya J., Rojas-Santiago M., Minimizing makespan in a two-machine no-wait flow shop with batch processing machines, International Journal of Advanced Manufacturing Technology, 63, 1-4, pp. 281-290, (2012)
12