Home ›
Entities
› academia
› A bi-objective evolutionary algorithm for minimizing maximum lateness and total pollution cost on non-identical parallel batch processing machines
A bi-objective evolutionary algorithm for minimizing maximum lateness and total pollution cost on non-identical parallel batch processing machines
A bi-objective evolutionary algorithm for minimizing maximum lateness and total pollution cost on non-identical parallel batch processing machines
Summary
A bi-objective evolutionary algorithm for minimizing maximum lateness and total pollution cost on non-identical parallel batch processing machines is a scholarly article[1].
Key Facts
A bi-objective evolutionary algorithm for minimizing maximum lateness and total pollution cost on non-identical parallel batch processing machines's instance of is recorded as scholarly article[2].
References
Programmatic citations — every numbered marker resolves to a verifiable graph row below.
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). A bi-objective evolutionary algorithm for minimizing maximum lateness and total pollution cost on non-identical parallel batch processing machines. Retrieved May 24, 2026, from https://4ort.xyz/entity/a-bi-objective-evolutionary-algorithm-for-minimizing-maximum-lateness-and-total-pollution-cost-on-non-identical-parallel
MLA“A bi-objective evolutionary algorithm for minimizing maximum lateness and total pollution cost on non-identical parallel batch processing machines.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/a-bi-objective-evolutionary-algorithm-for-minimizing-maximum-lateness-and-total-pollution-cost-on-non-identical-parallel.
BibTeX@misc{4ortxyz_a-bi-objective-evolutionary-algorithm-for-minimizing-maximum-lateness-and-total-pollution-cost-on-non-identical-parallel_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{A bi-objective evolutionary algorithm for minimizing maximum lateness and total pollution cost on non-identical parallel batch processing machines}}, year = {2026}, url = {https://4ort.xyz/entity/a-bi-objective-evolutionary-algorithm-for-minimizing-maximum-lateness-and-total-pollution-cost-on-non-identical-parallel}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): A bi-objective evolutionary algorithm for minimizing maximum lateness and total pollution cost on non-identical parallel batch processing machines — https://4ort.xyz/entity/a-bi-objective-evolutionary-algorithm-for-minimizing-maximum-lateness-and-total-pollution-cost-on-non-identical-parallel (retrieved 2026-05-24)
