Skip to main content
Log in

Heuristic and metaheuristic methods for the parallel unrelated machines scheduling problem: a survey

  • Published:
Artificial Intelligence Review Aims and scope Submit manuscript

Abstract

Scheduling has an immense effect on various areas of human lives, be it though its application in manufacturing and production industry, transportation, workforce allocation, or others. The unrelated parallel machines scheduling problem (UPMSP), which is one of the various problem types that exist, found its application in many areas like manufacturing and distributed computing. Due to the complexity of the problem, heuristic and metaheuristic methods have dominantly been applied for solving it. Although this problem variant did not receive much attention as other models, recent years saw the increase of research dealing with the UPMSP. During that time, different problem variants, solution methods, and interesting research directions were considered. However, no study provided a systematic overview of the research in which heuristic methods are applied for solving the UPMSP. This comes as a problem since it is becoming difficult to keep track of all the relevant research directions and solution methods considered for this problem. Therefore, the goal of this study is to provide an extensive literature review on the application of heuristic and metaheuristic methods for solving the UPMSP. Each reviewed study is briefly described based on the considered problem and solution method. Additionally, studies dealing with similar problems are grouped together to outline the evolution of the research, and possible areas where further research can be carried out. All studies were systematised and classified into several categories to allow for an easy overview of different problem and solution variants. Finally, recent research trends and possible future directions are also outlined.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

Availability of data and material

Not applicable

Code availability

Not applicable

References

Download references

Funding

This work has been supported in part by Croatian Science Foundation under the project IP-2019-04-4333.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Marko Ɖurasević.

Ethics declarations

Conflicts of interest/Competing interests

Not applicable

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ɖurasević, M., Jakobović, D. Heuristic and metaheuristic methods for the parallel unrelated machines scheduling problem: a survey. Artif Intell Rev 56, 3181–3289 (2023). https://doi.org/10.1007/s10462-022-10247-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10462-022-10247-9

Keywords

Navigation