A vibrant crossbreed social spider optimization with genetic algorithm tactic for flexible job shop scheduling problem
Job shop scheduling is one of the major issues in which the scheduling process is associated with the real-time manufacturing industry. A flexible job shop scheduling problem is one of the most important issues among the hardest combinatorial advancement issues. Flexible job shop scheduling is extre...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SAGE Publishing
2020-01-01
|
| Series: | Measurement + Control |
| Online Access: | https://doi.org/10.1177/0020294019889085 |