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.
APA4ort.xyz Knowledge Graph. (2026). NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness. Retrieved May 24, 2026, from https://4ort.xyz/entity/neh-based-heuristics-for-the-permutation-flowshop-scheduling-problem-to-minimise-total-tardiness
MLA“NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/neh-based-heuristics-for-the-permutation-flowshop-scheduling-problem-to-minimise-total-tardiness.
BibTeX@misc{4ortxyz_neh-based-heuristics-for-the-permutation-flowshop-scheduling-problem-to-minimise-total-tardiness_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness}}, year = {2026}, url = {https://4ort.xyz/entity/neh-based-heuristics-for-the-permutation-flowshop-scheduling-problem-to-minimise-total-tardiness}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness — https://4ort.xyz/entity/neh-based-heuristics-for-the-permutation-flowshop-scheduling-problem-to-minimise-total-tardiness (retrieved 2026-05-24)
