Improving the runtime of the serial PSO for the flexible job shop problem
| Autor: | Rim Zarrouk, Imed Bennour, Abderrazak Jemai |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
0209 industrial biotechnology
Job shop scheduling Computer science Generalization Job shop Swarm behaviour CPU time 02 engineering and technology Parallel computing Flow shop scheduling Term (time) 020901 industrial engineering & automation 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Central processing unit |
| Zdroj: | 2016 7th International Conference on Sciences of Electronics, Technologies of Information and Telecommunications (SETIT). |
| Popis: | The flexible job shop problem (FJSP) is a generalization of the classical job shop scheduling problem. The meta-heuristic particles swarm optimization (PSO) is well suited to solve the FJSP but it might be time consuming specially on monocore platforms. In this paper, we propose some PSO-FJSP variants that aim to improve the performance in term of CPU time. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|