Application of dynamic firework algorithm considering variable neighborhood strategy in flexible job shop scheduling problem
Aiming at the flexible job shop scheduling problem, this paper constructs a dual-objective mathematical model to minimize the maximum completion time and the minimum total processing cost. The traditional firework algorithm introduces a variable neighborhood search strategy, which is generated durin...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
EDP Sciences
2021-01-01
|
| Series: | E3S Web of Conferences |
| Subjects: | |
| Online Access: | https://www.e3s-conferences.org/articles/e3sconf/pdf/2021/44/e3sconf_vesep2020_01062.pdf |