Abstract
Maintenance support resource scheduling (MSRS) problem has attracted increasing attention in modern battle. Its objective is minimizing execution time of allocating multiple resources from multiple supply centers to tasks. As a NP-hard problem, there exist various constraints in the MSRS problem, including resource demands of tasks, resource reserves of supply centers and transport paths constraint. In this paper, we first build two models taking route planning and resource scheduling into consideration simultaneously. Then, with cutting plane approach and dual algorithm, we can obtain the optimal scheduling schemes corresponding to two models. Besides, the performance of the two approaches are verified with different scale instances.
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.
