Nowadays, scheduling problem in the field of production planning has been considered by many researchers and this issue is used in various industries. Using the same parallel machines reduces the queue of WIP behind the machine and also increases production. Since scheduling problems in large scale are NP-hard, to solve them, metaheuristic algorithms are used. In this paper, Ant colony optimisation and Harmony Search algorithm are used to solve the problem as well as comparison with two other algorithms and finally, their performance is analysed and the efficient algorithm is investigated.

中文翻译：

---

使用两种元启发式算法在作业车间行业中调度具有序列相关设置时间的并行机器

如今，生产计划领域的调度问题已经被许多研究人员考虑，并且这个问题被用于各个行业。使用相同的并行机器减少了机器后面的 WIP 队列，也增加了产量。由于大规模调度问题是 NP-hard 问题，为了解决它们，使用元启发式算法。本文采用蚁群优化算法和Harmony Search算法求解该问题，并与其他两种算法进行了比较，最后对其性能进行了分析，考察了算法的有效性。