Dual⁃resource constrained flexible job shop optimal scheduling based on an improved Jaya algorithm
|更新时间:2025-05-26
|
Dual⁃resource constrained flexible job shop optimal scheduling based on an improved Jaya algorithm
“In the field of flexible job shop scheduling, experts have proposed an improved Jaya algorithm, which effectively solves the problem of dual resource constraints and achieves reasonable personnel allocation and rapid sorting of workpieces.”
Journal of Jilin University(Engineering and Technology Edition)Vol. 53, Issue 2, Pages: 480-487(2023)
GUO Peng,ZHAO Wen-chao,LEI Kun.Dual⁃resource constrained flexible job shop optimal scheduling based on an improved Jaya algorithm[J].Journal of Jilin University(Engineering and Technology Edition),2023,53(02):480-487.
GUO Peng,ZHAO Wen-chao,LEI Kun.Dual⁃resource constrained flexible job shop optimal scheduling based on an improved Jaya algorithm[J].Journal of Jilin University(Engineering and Technology Edition),2023,53(02):480-487. DOI: 10.13229/j.cnki.jdxbgxb20210622.
Dual⁃resource constrained flexible job shop optimal scheduling based on an improved Jaya algorithm