Solving robotic distributed flowshop problem using an improved iterated greedy algorithm
In this study, we propose an improved iterated greedy algorithm for solving the distributed permutation flowshop problem, where there is a single robot in each factory and the makespan needs to be minimized. In the problem considered, the robot is used to transfer each job from the predecessor machi...
Spremljeno u:
| Glavni autori: | , , , , , , |
|---|---|
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
SAGE Publishing
2019-10-01
|
| Serija: | International Journal of Advanced Robotic Systems |
| Online pristup: | https://doi.org/10.1177/1729881419879819 |
| Oznake: |
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|