Improving the TSAB algorithm through parallel computing
In this paper, a parallel multi-path variant of the well-known TSAB algorithm for the job shop scheduling problem is proposed. Coarse-grained parallelization method is employed, which allows for great scalability of the algorithm with accordance to Gustafon’s law. The resulting P-TSAB algorithm is t...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Polish Academy of Sciences
2020-09-01
|
| Series: | Archives of Control Sciences |
| Subjects: | |
| Online Access: | https://journals.pan.pl/Content/117705/PDF/art02.pdf |