Harmony search algorithm to enhance approach to permutation flow shop scheduling problem
The permutation flow-shop scheduling problem (PFSP) is one of the widely analysed and investigated problems within the general field of scheduling, as its major focus is on the allocation and sequencing of a set of jobs across a set of machines in order to minimize the makespan or satisfy other cri...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Siberian Scientific Center DNIT
2024-11-01
|
| Series: | Информатика. Экономика. Управление |
| Subjects: | |
| Online Access: | https://oajiem.com/index.php/24/article/view/103 |