A Critical Path-Based Bi-Population Cooperative Coevolutionary Algorithm for Hybrid Lot-Streaming Flow Shop Scheduling Problem
IEEE Transactions on Systems, Man, and Cybernetics: Systems · 2026-11 · 56 (11) · 6641-6655
DOI: 10.1109/tsmc.2026.3714501 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Systems, Man, and Cybernetics: Systems, 2026-11. Verfasst von Fuqing Zhao und 3 weiteren Autor:innen. Die Arbeit nennt 60 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Industry Support Project of Gansu Province College, Lanzhou Science and Technology Planning Project.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- National Natural Science Foundation of China
- Industry Support Project of Gansu Province College
- Lanzhou Science and Technology Planning Project
Zitieren
APA
Zhao, F., Cai, S., Wang, L., & Yu, Y. (2026). A Critical Path-Based Bi-Population Cooperative Coevolutionary Algorithm for Hybrid Lot-Streaming Flow Shop Scheduling Problem. IEEE Transactions on Systems, Man, and Cybernetics: Systems, 56(11), 6641-6655. https://doi.org/10.1109/tsmc.2026.3714501
Vancouver
Zhao F, Cai S, Wang L, Yu Y. A Critical Path-Based Bi-Population Cooperative Coevolutionary Algorithm for Hybrid Lot-Streaming Flow Shop Scheduling Problem. IEEE Transactions on Systems, Man, and Cybernetics: Systems. 2026;56(11):6641-6655. doi:10.1109/tsmc.2026.3714501
BibTeX
@article{Zhao2026,
author = {Zhao, Fuqing and Cai, Shaoqi and Wang, Ling and Yu, Yang},
title = {A Critical Path-Based Bi-Population Cooperative Coevolutionary Algorithm for Hybrid Lot-Streaming Flow Shop Scheduling Problem},
journal = {IEEE Transactions on Systems, Man, and Cybernetics: Systems},
year = {2026},
volume = {56},
number = {11},
pages = {6641--6655},
doi = {10.1109/tsmc.2026.3714501}
}
EUVIMED