Abstract
This chapter presents and evaluates two heuristic search strategies and their applications to the scheduling of resource allocation systems (RASs) in an SC‐net framework. SC‐nets can concisely model strict precedence constraints, alternative routes, multiple kinds of resources, concurrent activities, and operation times, which are common in RASs. To handle the schedule complexities of the SC‐nets, the chapter presents an admissible heuristic function for these nets and two controllable heuristic A* search methods by using a heuristic function. The first search method does not need to predict the depth of a solution in advance and the quality of the obtained schedule is controllable. The second search method combines an A* search with a depth‐first strategy based on the execution of SC‐nets to cope with the complexities of RAS scheduling – controllable hybrid heuristic search.
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 callDisclaimer: 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.
