Examining the developments in scheduling algorithms research: A bibliometric approach

This dataset contained 12,644 peer-reviewed documents extracted from the Scopus database. The search string for extractibg the data:( TITLE-ABS-KEY ( "Scheduling Algorithm*" ) AND TITLE-ABS-KEY ( "Multilevel queue" OR "Round Robin" OR "Shortest Job First" OR "First Come First Serve" OR "Shortest Remaining Time" OR "Priority queue" OR "Makespan" OR "average waiting time" OR "turnaround time" OR "Context Switch*" OR "Completion time" OR "Resource allocation" OR "Time Quantum" OR "Grid computing" OR "Cloud Computing" OR "Edge Computing" OR "Fuzzy Computing" OR "Evolutionary Computing" OR "Green Computing" ) ) AND ( EXCLUDE ( SRCTYPE , "Undefined" ) ) AND ( EXCLUDE ( PUBSTAGE , "aip" ) ) AND ( LIMIT-TO (PUBYEAR > 1991 AND PUBYEAR < 2022)) AND ( LIMIT-TO ( LANGUAGE , "English" ) ). The data can be used to examine the development status of the field of Scheduling Algorithms, the growth rate, emerging thematic areas for further research, institutions, and country collaborations. It also identified the most impactful and leading authors, keywords, sources, and publications in this field. The findings can help both budding and established researchers to find new research focus, collaboration opportunities and make an informed decision as they research the field of scheduling algorithms and their applications.