Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Rim Zarrouk"'
Publikováno v:
Applied Sciences, Vol 12, Iss 6, p 2829 (2022)
Since of the advent of Industry 4.0, embedded systems have become an indispensable component of our life. However, one of the most significant disadvantages of these gadgets is their high power consumption. It was demonstrated that making efficient u
Externí odkaz:
https://doaj.org/article/48294302a9214042bc3f49a2386604fb
Publikováno v:
Swarm Intelligence. 13:145-168
Particle swarm optimization is a population-based stochastic algorithm designed to solve difficult optimization problems, such as the flexible job shop scheduling problem. This problem consists of scheduling a set of operations on a set of machines w
Publikováno v:
2019 IEEE 17th World Symposium on Applied Machine Intelligence and Informatics (SAMI).
Particle swarm optimization (PSO) is a population-based stochastic algorithm designed to solve complex optimization problems such as the Flexible Job Shop Scheduling Problem (FJSP). As a metaheuristic, the performance of the PSO is heavily affected b
Autor:
Rim Zarrouk, Abderrazak Jemai
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319920573
IEA/AIE
IEA/AIE
The metaheuristic Particle Swarm Optimization (PSO) is well suited to solve the Flexible Job Shop Scheduling Problem (FJSP), and a suitable particle representation should importantly impact the optimization results and performance of this algorithm.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9a4bcbac5e9278ad3c0ab5486095a742
https://doi.org/10.1007/978-3-319-92058-0_38
https://doi.org/10.1007/978-3-319-92058-0_38
Publikováno v:
Procedia Computer Science. 73:146-153
The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The particle swarm optimization (PSO) is an evolutionary algorithm that uses
Publikováno v:
Advances in Artificial Intelligence: From Theory to Practice ISBN: 9783319600413
IEA/AIE (1)
IEA/AIE (1)
One of the most challenging problems in manufacturing field is to solve the flexible job shop (FJS) problem subject to machines breakdown. In this paper, we propose two rescheduling solutions to handle machine breakdowns: a PSO-based solution and a s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b02261c2f860e639705a29d387a59153
https://doi.org/10.1007/978-3-319-60042-0_14
https://doi.org/10.1007/978-3-319-60042-0_14
Publikováno v:
2016 7th International Conference on Sciences of Electronics, Technologies of Information and Telecommunications (SETIT).
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 platfor
Publikováno v:
International Journal of Computational Science and Engineering. 19:483
Optimisation meta-heuristics such as particle swarm optimisation (PSO) require high-performance computing (HPC). The use of software parallelism and hardware parallelism is mandatory to achieve HPC. Thread-level parallelism is a common software solut
Publikováno v:
International Journal of Intelligent Engineering Informatics. 6:396
One of the most challenging problems in the manufacturing field is to solve the flexible job shop problem (FJSP) subject to machine breakdowns (caused a loss of time). The meta-heuristic particles swarm optimisation (PSO) is well suited to solve the