A Bee Colony Algorithm based Solver for Flow Shop Scheduling Problem
Flow Shop Scheduling (FSS) is scheduled to involve n jobs and m machines in the same process sequence, where each machine processes precisely one job in a certain period. In FSS, when a machine is doing work, other machines cannot do the same job simultaneously. The solution to this problem is the j...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Politeknik Negeri Padang
2021-05-01
|
| Series: | JOIV: International Journal on Informatics Visualization |
| Subjects: | |
| Online Access: | https://joiv.org/index.php/joiv/article/view/491 |