The distributed fog node network and variable workloads make task distribution difficult in fog computing. Optimizing computing resources for dynamic workloads with heuristic and metaheuristic algorithms has shown potential. To address changing workloads, these algorithms enable real-time decision-making. This systematic review examines heuristic, meta-heuristic, and real-time dynamic job scheduling strategies in fog computing. Static methods like heuristic and meta-heuristic algorithms can help modify dynamic task scheduling in fog computing situations. This paper covers a current study area that stresses real-time approaches, meta-heuristics, and fog computing environments' dynamic nature. It also helps build reliable and scalable fog computing systems by spotting dynamic task scheduling trends, patterns, and issues. This study summarizes and analyzes the latest fog computing research on task-scheduling algorithms and their pros and cons to adequately address their issues. Fog computing task scheduling strategies are detailed and classified using a technical taxonomy. This work promises to improve system performance, resource utilization, and fog computing settings. The work also identifies fog computing job scheduling innovations and improvements. It reveals the strengths and weaknesses of present techniques, paving the way for fog computing research to address unresolved difficulties and anticipate future challenges.
Collaboration network of the authors
17 authors ·
51 co-authorship links
· 40 across different organisations
Hover or tap a name to highlight its co-authors. Double-click to open the author's page.
Al-Hussein Bin Talal University
Universiti Malaysia Terengganu
Sultan Zainal Abidin University
National University of Malaysia
Gulf University for Science & Technology
Hashemite University
Gachon University
Other organisations
Different organisations
Same organisation
Affiliation unknown
Thicker line = more joint articles · bigger circle = more articles
Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.