Solving a new robust reverse job shop scheduling problem by meta-heuristic algorithms

Research article (Engineering Applications of Artificial Intelligence, 2021) · cited 25× · AI/ML

academia openalex:W3134095470

Press Enter · cited answer in seconds

Solving a new robust reverse job shop scheduling problem by meta-heuristic algorithms

Summary

Solving a new robust reverse job shop scheduling problem by meta-heuristic algorithms is a scholarly article^[1].

Key Facts

Solving a new robust reverse job shop scheduling problem by 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

[2] ↑ Solving a new robust reverse job shop scheduling problem by meta-heuristic algorithms — instance of (P31): scholarly article. wikidata.org.

Class ancestry

[1] ↑ Solving a new robust reverse job shop scheduling problem by meta-heuristic algorithms is an instance of scholarly article (scholarly article) [P31, primary]. 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). Solving a new robust reverse job shop scheduling problem by meta-heuristic algorithms. Retrieved May 24, 2026, from https://4ort.xyz/entity/solving-a-new-robust-reverse-job-shop-scheduling-problem-by-meta-heuristic-algorithms

MLA

“Solving a new robust reverse job shop scheduling problem by meta-heuristic algorithms.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/solving-a-new-robust-reverse-job-shop-scheduling-problem-by-meta-heuristic-algorithms.

BibTeX

@misc{4ortxyz_solving-a-new-robust-reverse-job-shop-scheduling-problem-by-meta-heuristic-algorithms_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Solving a new robust reverse job shop scheduling problem by meta-heuristic algorithms}}, year = {2026}, url = {https://4ort.xyz/entity/solving-a-new-robust-reverse-job-shop-scheduling-problem-by-meta-heuristic-algorithms}, note = {Accessed: 2026-05-24}}

LLM prompt

According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Solving a new robust reverse job shop scheduling problem by meta-heuristic algorithms — https://4ort.xyz/entity/solving-a-new-robust-reverse-job-shop-scheduling-problem-by-meta-heuristic-algorithms (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/solving-a-new-robust-reverse-job-shop-scheduling-problem-by-meta-heuristic-algorithms · Last refreshed: May 24, 2026