Multi-Agent Model based on Tabu Search for the Permutation Flow Shop Scheduling Problem
The objective of this work is to present a distributed approach for the problem of finding a minimum makespan in the permutation flow shop scheduling problem. The problem is strongly NP-hard and its resolution optimally within a reasonable time is impossible. For these reasons we opted for a Multi-a...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Ediciones Universidad de Salamanca
2014-10-01
|
| Series: | Advances in Distributed Computing and Artificial Intelligence Journal |
| Subjects: | |
| Online Access: | https://revistas.usal.es/index.php/2255-2863/article/view/12006 |