Branching Deep Q-Network Enhanced Memetic Algorithm for Skilled-Worker Constrained Flexible Job Shop Scheduling Problem
IEEE Transactions on Evolutionary Computation · 2026 · 1-1
DOI: 10.1109/tevc.2026.3722402 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Evolutionary Computation, 2026. Verfasst von Chi Zhang und 4 weiteren Autor:innen. Gefördert von: National Natural Science Foundation of China, Program of Shanghai Academic Research Leader, Shanghai Key Laboratory of Power station Automation Technology.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- National Natural Science Foundation of China
- Program of Shanghai Academic Research Leader
- Shanghai Key Laboratory of Power station Automation Technology
Zitieren
APA
Zhang, C., Pan, Q., Wang, L., Miao, Z., & Li, W. (2026). Branching Deep Q-Network Enhanced Memetic Algorithm for Skilled-Worker Constrained Flexible Job Shop Scheduling Problem. IEEE Transactions on Evolutionary Computation, 1-1. https://doi.org/10.1109/tevc.2026.3722402
Vancouver
Zhang C, Pan Q, Wang L, Miao Z, Li W. Branching Deep Q-Network Enhanced Memetic Algorithm for Skilled-Worker Constrained Flexible Job Shop Scheduling Problem. IEEE Transactions on Evolutionary Computation. 2026:1-1. doi:10.1109/tevc.2026.3722402
BibTeX
@article{Zhang2026,
author = {Zhang, Chi and Pan, Quanke and Wang, Ling and Miao, Zhonghua and Li, Weimin},
title = {Branching Deep Q-Network Enhanced Memetic Algorithm for Skilled-Worker Constrained Flexible Job Shop Scheduling Problem},
journal = {IEEE Transactions on Evolutionary Computation},
year = {2026},
pages = {1--1},
doi = {10.1109/tevc.2026.3722402}
}
EUVIMED