Home ›
Entities
› academia
› An ACO algorithm for makespan minimization in parallel batch machines with non-identical job sizes and incompatible job families
An ACO algorithm for makespan minimization in parallel batch machines with non-identical job sizes and incompatible job families
An ACO algorithm for makespan minimization in parallel batch machines with non-identical job sizes and incompatible job families
Summary
An ACO algorithm for makespan minimization in parallel batch machines with non-identical job sizes and incompatible job families is a scholarly article[1].
Key Facts
An ACO algorithm for makespan minimization in parallel batch machines with non-identical job sizes and incompatible job families'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). An ACO algorithm for makespan minimization in parallel batch machines with non-identical job sizes and incompatible job families. Retrieved May 24, 2026, from https://4ort.xyz/entity/an-aco-algorithm-for-makespan-minimization-in-parallel-batch-machines-with-non-identical-job-sizes-and-incompatible-job-
MLA“An ACO algorithm for makespan minimization in parallel batch machines with non-identical job sizes and incompatible job families.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/an-aco-algorithm-for-makespan-minimization-in-parallel-batch-machines-with-non-identical-job-sizes-and-incompatible-job-.
BibTeX@misc{4ortxyz_an-aco-algorithm-for-makespan-minimization-in-parallel-batch-machines-with-non-identical-job-sizes-and-incompatible-job-_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{An ACO algorithm for makespan minimization in parallel batch machines with non-identical job sizes and incompatible job families}}, year = {2026}, url = {https://4ort.xyz/entity/an-aco-algorithm-for-makespan-minimization-in-parallel-batch-machines-with-non-identical-job-sizes-and-incompatible-job-}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): An ACO algorithm for makespan minimization in parallel batch machines with non-identical job sizes and incompatible job families — https://4ort.xyz/entity/an-aco-algorithm-for-makespan-minimization-in-parallel-batch-machines-with-non-identical-job-sizes-and-incompatible-job- (retrieved 2026-05-24)
