A dynamic opposite learning assisted grasshopper optimization algorithm for the flexible job scheduling problem
Job shop scheduling problem (JSP) is one of the most difficult optimization problems in manufacturing industry, and flexible job shop scheduling problem (FJSP) is an extension of the classical JSP, which further challenges the algorithm performance. In FJSP, a machine should be selected for each pro...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2020
|
| Online Access: | https://eprints.nottingham.ac.uk/65351/ |