Abstract
Several scheduling optimization problems belong to the NP-complete class, including, task scheduling, job shop scheduling, and patient admission. These problems commonly require the development of heuristics approaches to find near-optimal solutions within reasonable timeframes. In this work, we present MaSchedule an open-source multi-agent tool for the design of heuristics for scheduling problems.
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 callSimilar Papers
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.
