Abstract
Scheduling tasks in overloaded real-time systems is a challenging problem that has received a significant amount of attention in recent years. The processor is overloaded with more tasks than its capacity, resulting in missed deadlines and degraded system performance. Therefore, scheduling algorithms play a critical role in ensuring that high-priority tasks are completed on time while minimizing the impact of incomplete lower-priority tasks. This paper proposes an efficient Weighted Partial MaxSAT(WPMS) encoding that returns an optimal solution in which the total weight of incomplete tasks is minimized in a single machine environment. To assess the efficiency of our proposed formulation, a comparative analysis is conducted alongside the state-of-the-art encoding. By examining the solving 75 distinct problems, it becomes evident that the WPMS encoding proposed herein exhibits a considerable advantage in terms of both time and memory efficiency.
Sign-in/Register to access full text options 
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 callMore From: International Journal of Computers and Applications
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.
