Home › Entities › academia › <scp>HEART</scp>: Unrelated parallel machines problem with precedence constraints for task scheduling in cloud computing using heuristic and <scp>meta‐heuristic</scp> algorithms

<scp>HEART</scp>: Unrelated parallel machines problem with precedence constraints for task scheduling in cloud computing using heuristic and <scp>meta‐heuristic</scp> algorithms

Research article (Software Practice and Experience, 2020) · cited 17× · AI/ML
academia openalex:W3083808844
Press Enter · cited answer in seconds

HEART: Unrelated parallel machines problem with precedence constraints for task scheduling in cloud computing using heuristic and meta‐heuristic algorithms

Summary

HEART: Unrelated parallel machines problem with precedence constraints for task scheduling in cloud computing using heuristic and meta‐heuristic algorithms is a scholarly article[1].

Key Facts

  • HEART: Unrelated parallel machines problem with precedence constraints for task scheduling in cloud computing using heuristic and meta‐heuristic algorithms's instance of is recorded as scholarly article[2].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). <scp>HEART</scp>: Unrelated parallel machines problem with precedence constraints for task scheduling in cloud computing using heuristic and <scp>meta‐heuristic</scp> algorithms. Retrieved May 24, 2026, from https://4ort.xyz/entity/scp-heart-scp-unrelated-parallel-machines-problem-with-precedence-constraints-for-task-scheduling-in-cloud-computing-usi
MLA “<scp>HEART</scp>: Unrelated parallel machines problem with precedence constraints for task scheduling in cloud computing using heuristic and <scp>meta‐heuristic</scp> algorithms.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/scp-heart-scp-unrelated-parallel-machines-problem-with-precedence-constraints-for-task-scheduling-in-cloud-computing-usi.
BibTeX @misc{4ortxyz_scp-heart-scp-unrelated-parallel-machines-problem-with-precedence-constraints-for-task-scheduling-in-cloud-computing-usi_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{<scp>HEART</scp>: Unrelated parallel machines problem with precedence constraints for task scheduling in cloud computing using heuristic and <scp>meta‐heuristic</scp> algorithms}}, year = {2026}, url = {https://4ort.xyz/entity/scp-heart-scp-unrelated-parallel-machines-problem-with-precedence-constraints-for-task-scheduling-in-cloud-computing-usi}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): <scp>HEART</scp>: Unrelated parallel machines problem with precedence constraints for task scheduling in cloud computing using heuristic and <scp>meta‐heuristic</scp> algorithms — https://4ort.xyz/entity/scp-heart-scp-unrelated-parallel-machines-problem-with-precedence-constraints-for-task-scheduling-in-cloud-computing-usi (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/scp-heart-scp-unrelated-parallel-machines-problem-with-precedence-constraints-for-task-scheduling-in-cloud-computing-usi · Last refreshed: