Today scheduling problems have an immense effect on various areas of human lives, be it from their application in manufacturing and production industry, transportation, or workforce allocation. The unrelated parallel machines scheduling problem (UPMSP), which is only one of the many different problem types that exist, found its application in many areas like production industries or distributed computing. Due to the complexity of the problem, heuristic and metaheuristic methods are gaining more attention for solving it. Although this problem variant did not receive much attention as other models, recent years saw the increase of research dealing with this problem. During that time, many different problem variants, solution methods, or other interesting research directions were considered. However, no study has until now tried to systematise the research in which heuristic methods are applied for the UPMSP. The goal of this study is to provide an extensive literature review on the application of heuristic and metaheuristic methods for solving the UPMSP. The research was systematised and classified into several categories to enable an easy overview of the different problem and solution variants. Additionally, current trends and possible future research directions are also shortly outlined.

中文翻译：

---

无关机器调度问题的启发式和元启发式方法：调查

今天，调度问题对人类生活的各个领域都产生了巨大的影响，无论是在制造和生产行业、运输还是劳动力分配中的应用。无关并行机调度问题 (UPMSP) 只是存在的众多不同问题类型中的一种，在生产行业或分布式计算等许多领域都有其应用。由于问题的复杂性，启发式和元启发式方法在解决问题上越来越受到关注。虽然这个问题变体没有像其他模型那样受到太多关注，但近年来处理这个问题的研究有所增加。在此期间，考虑了许多不同的问题变体、解决方法或其他有趣的研究方向。然而，迄今为止，还没有任何研究试图将启发式方法应用于 UPMSP 的研究系统化。本研究的目的是对启发式和元启发式方法在解决 UPMSP 中的应用提供广泛的文献综述。该研究被系统化并分为几个类别，以便能够轻松概览不同的问题和解决方案变体。此外，还简要概述了当前的趋势和可能的未来研究方向。