In view of the difficulty of obtaining the optimal solution to the multi-objective scheduling of flexible job-shop by the general genetic algorithm, this paper takes into account the shortest processing time and the balanced use of machines, and puts forward the multi-population genetic algorithm based on the multi-objective scheduling of flexible job-shop. The method attempts to minimize the longest make-span of workpieces, the load of each machine, and the total machine load through the overall process scheduling of the job-shop. Research results reveal that the proposed method is highly efficient in seeking the optimal machine allocation chain, and effective in avoiding the complex process of intermediate assignment, making it easier to obtain the said optimal solution. The feasibility and effectiveness of the proposed method are also validated by two instances. Compared with the conventional flexible job-shop scheduling algorithms, the proposed algorithm boasts better population quality, algorithm starting point, and initial expression. Besides, it is far better than other algorithms in terms of the initial solution quality and the convergence rate. Despite the local fluctuations in the early phase of the genetic process, the total machine load and the machine load variance are gradually declining and the curves start to converge after the 50 th generation.
Reconfigurable intelligent surface (RIS) is an emerging technology to improve the spectral efficiency of wireless communication systems. However, the high complexity of beam design and the non-negligible overhead associated with RIS limit the number of elements that can be deployed in practice. In this paper, we investigate the downlink communications of irregularly deployed intelligent reflecting surfaces that assist non-orthogonal multiple access (NOMA) systems. To address this challenge, we propose a novel four-step resource allocation algorithm. Specifically, we first obtain a sub-optimal solution for the sparse deployment of RIS elements using a simulated annealing algorithm. We then solve the power allocation problem by employing an integer optimization algorithm that continuously iterates the immobile point. To simplify and optimize the reflection coefficient matrix, we propose a construction inequality algorithm. Finally, we optimize the channel assignment using a genetic algorithm. The simulation results demonstrate that the proposed irregular RIS-assisted NOMA system outperforms the traditional RIS-assisted orthogonal multiple access (OMA) system, with a maximum throughput increase of approximately 30%.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.