Bi-objective flexible job shop scheduling problems
DATASET contain 23 FFJSP isntances
Compare algorithms including IAIS MOEA/D MOEA/D-M2M NSGA-II NSGA-III
IMOEA/D is a improved algorithm for BFFJSP.
More detail please read paper.
-
Notifications
You must be signed in to change notification settings - Fork 2
CUGLiRui/BFFJSP
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
About
Bi-objective flexible job shop scheduling problems
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published