Abstract

Beam scheduling is necessary for a multifunction radar(MFR) to perform multiple tasks and manage the resources of the radar efficiently. In this paper, we introduce the concept of the job shop problem to solve the beam-scheduling problem, and apply heuristic algorithms to enable reasonable beam allocation by the MFR. Then, we select three indicators, frame time, total weighed tardiness, and the number of targets dropped out, by considering realistic operation of the MFR. Based on the simulation results, we analyze the scheduling of each algorithm according to the number of targets and compare the performance of the algorithms.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.